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
Propositional resizing is an axiom often assumed in homotopy type theory that states that all mere propositions are small. This is a form of impredicativity since it implies propositional impredicativity and thus power sets for successor universes.
Despite that, propositional resizing is a relatively weak axiom, for instance it is implied by the law of excluded middle, which states that the small type classifies all propositions. However, it is independent of the other basic axioms of homotopy type theory.
Propositional resizing can be defined for individual type universes (Gylterud, Stenholm, & Veltri 2020) or for the type theory as a whole (HoTT Book).
In dependent type theory where for every type , there is a type universe such that is essentially -small, one can define propositional resizing for the entire type theory: a universe satisfies -propositional resizing if every proposition in is essentially -small. Propositional resizing for the entire dependent type theory then is the axiom that all universes satisfy -resizing for all universes .
If the universe additionally contains a type classifying all -small types, then the type is a -small type of all -small propositions, making the universe satisfy propositional impredicativity. In particular, for a natural numbers-indexed universe hierarchy such as those found in the HoTT book and proof assistants like Lean, Agda, and Rocq, if propositional resizing holds, then every successor universe is a propositionally impredicative universe, while only the base universe is a predicative universe.
In dependent type theory with a single type judgment, a type universe satisfies propositional resizing if every proposition in the dependent type theory is essentially -small. The type is a type of all propositions, making the whole dependent type theory satisfy propositional impredicativity.
Section 3.5 of The HoTT Book
Taichi Uemura, Cubical Assemblies and the Independence of the Propositional Resizing Axiom, HoTT/UF 2018 abstract slides
Tom de Jong, Martín Hötzel Escardó, Domain Theory in Constructive and Predicative Univalent Foundations, in: 29th EACSL Annual Conference on Computer Science Logic, CSL 2021, LIPIcs proceedings 183, 2021 (doi:10.4230/LIPIcs.CSL.2021.28, arXiv:2008.01422)
Håkon Robbestad Gylterud, Elisabeth Stenholm, Niccolò Veltri, Terminal Coalgebras and Non-wellfounded Sets in Homotopy Type Theory [arXiv:2001.06696]
Benedikt Ahrens, Paige Randall North, Michael Shulman, Dimitris Tsementzis, The Univalence Principle [abs:2102.06275]
Marc Bezem, Ulrik Buchholtz, Pierre Cagne, Bjørn Ian Dundas, Daniel R. Grayson, Section 2.18 in: Symmetry (2025) pdf
Last revised on June 14, 2025 at 23:27:35. See the history of this page for a list of all contributions to it.