basic constructions:
strong axioms
further
(in category theory/type theory/computer science)
of all homotopy types
of (-1)-truncated types/h-propositions
natural deduction metalanguage, practical foundations
type theory (dependent, intensional, observational type theory, homotopy type theory)
computational trinitarianism =
propositions as types +programs as proofs +relation type theory/category theory
In dependent type theory, the axiom of replacement states that given a type universe , for every essentially -small type , every locally -small type , and every function , the image is essentially -small.
Equivalently, given types and and Tarski universe , there is a function
If the dependent type theory has type variables and impredicative polymorphism, the axiom of replacement can be expressed as an actual axiom rather than an axiom schema:
There is a variant of the axiom of replacement in dependent type theory called the axiom of set replacement, which restricts the type in the above statement of the axiom of replacement to be a set. The axiom of set replacement is equivalent to the existence of quotient sets in the type universe .
Egbert Rijke, The join construction, 26 Jan 2017, (arXiv:1701.07538)
Marc Bezem, Ulrik Buchholtz, Pierre Cagne, Bjørn Ian Dundas, Daniel R. Grayson, Section 2.19 in: Symmetry (2021) pdf
Egbert Rijke, Introduction to Homotopy Type Theory, Cambridge Studies in Advanced Mathematics, Cambridge University Press (arXiv:2212.11082)
Ayberk Tosun, Constructive and Predicative Locale Theory in Univalent Foundations (arXiv:2603.01308)
Last revised on May 29, 2026 at 19:00:36. See the history of this page for a list of all contributions to it.