(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: without it, no universes can be shown to be closed under forming power sets.
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.
A universe satisfies -propositional resizing if every proposition is essentially -small. Propositional resizing is then the axiom that all universes satisfy resizing for all universes .
If contains a type classifying all types, then the type is a -small type of all propositions, making an impredicative universe.
Section 3.5 of The HoTT Book
Taichi Uemura, Cubical Assemblies and the Independence of the Propositional Resizing Axiom, HoTT/UF 2018 abstract slides
Last revised on February 27, 2025 at 15:19:28. See the history of this page for a list of all contributions to it.