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:
Assuming function extensionality, the axiom of replacement holds for any univalent universe that is closed under pushout types and contains a natural numbers type (Rijke 17, Theorem 4.6).
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.
Assuming propositional extensionality and function extensionality, the axiom of set replacement is equivalent to the existence of quotient sets in the type universe (De Jong and Escardó 23, Theorem 3.29) and is derivable from propositional resizing (Rijke and Spitters 15, Lemma 3.28).
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, Section 18.1 of: Introduction to Homotopy Type Theory, Cambridge Studies in Advanced Mathematics, Cambridge University Press (arXiv:2212.11082)
Evan Cavallo, Thierry Coquand, Type-theoretic replacement and univalent completion: applications and interpretations, 31st International Conference on Types for Proofs and Programs (TYPES 2025), Leibniz International Proceedings in Informatics (LIPIcs) 384 (2026) 10:1–10:27 [doi:10.4230/LIPIcs.TYPES.2025.10]
Regarding set replacement:
Egbert Rijke, Bas Spitters, Section 3.4 of: Sets in homotopy type theory, Mathematical Structures in Computer Science 25 Special Issue 5: From type theory and homotopy theory to Univalent Foundations of Mathematics (2015) 1172 - 1202 [arXiv:1305.3835, doi:10.1017/S0960129514000553]
Tom de Jong, Martín Hötzel Escardó, Section 3.4 of: On Small Types in Univalent Foundations, Logical Methods in Computer Science 19 2 (2023) [arXiv:2111.00482, doi:10.46298/lmcs-19(2:8)2023]
Tom de Jong, Section 2.11.4 of: Domain Theory in Constructive and Predicative Univalent Foundations, PhD thesis, University of Birmingham (2023) [url, arXiv:2301.12405]
Ayberk Tosun, Section 2.15 of: Constructive and Predicative Locale Theory in Univalent Foundations, PhD thesis, University of Birmingham (2025) [url, arXiv:2603.01308]
Last revised on November 17, 2026 at 12:37:43. See the history of this page for a list of all contributions to it.