Lawvere theories and Jf-relative monads
Vladimir Voevodsky

TL;DR
This paper constructs a fully constructive equivalence between Lawvere theories and Jf-relative monads, applicable within ZF set theory without choice or excluded middle, and suitable for formalization in UniMath.
Contribution
It provides a detailed, constructive proof of the equivalence between Lawvere theories and Jf-relative monads, expanding the categorical understanding of algebraic theories.
Findings
Established a constructive equivalence between Lawvere theories and Jf-relative monads.
Methods are formalizable in ZF set theory without choice or excluded middle.
Results are compatible with formal proof systems like UniMath.
Abstract
In this paper we provide a detailed construction of an equivalence between the category of Lawvere theories and the category of relative monads on the obvious functor where is the category with the set of objects and morphisms being the functions between the standard finite sets of the corresponding cardinalities. The methods of this paper are fully constructive and it should be formalizable in the Zermelo-Fraenkel theory without the axiom of choice and the excluded middle. It is also easily formalizable in the UniMath.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsHomotopy and Cohomology in Algebraic Topology · Advanced Topology and Set Theory · Computability, Logic, AI Algorithms
