(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 defined via universes and universe levels, local propositional resizing is a weak version of the propositional resizing axiom which says that given a universe level , the type of propositions of each universe is -small. The dependent type theory is then said to be locally impredicative or to have local impredicativity.
Unlike the usual propositional resizing axiom, the local propositional resizing axiom makes no assumption on the equivalence of the types of propositions for different universe levels. It is possible to assume local propositional resizing, excluded middle for one universe , and Brouwer's continuity principle for Dedekind real numbers for another universe where , thus making and provably inequivalent types and contradicting the propositional resizing axiom.
Thus, while each universe itself is impredicative in the sense of having a type of all -small propositions, the dependent type theory itself is still predicative since there is no type of all propositions in the type theory. However, local propositional resizing suffices for impredicative mathematics in most cases, since one is usually working inside of a universe and only the -small propositions are relevant.
The name local propositional resizing and global propositional resizing, along with locally impredicative and globally impredicative is in analogue with local univalence and global univalence for univalent bicategories: while all univalent bicategories are locally univalent, not all locally univalent bicategories are univalent bicategories. Similarly, while all impredicative dependent type theories are locally impredicative, not all locally impredicative dependent type theories are impredicative.
We assume an infinite hierarchy of Russell universes or Coquand universes indexed by natural numbers in the metatheory or defined separately in some other sort.
The axiom of weak local propositional resizing says that the type of propositions is essentially -small
The dependent type theory is weakly locally impredicative or said to have weak local impredicativity.
The axiom of strict local propositional resizing says that the type of propositions is -small:
The dependent type theory is strictly locally impredicative or said to have strict local impredicativity.
In the case for Coquand universes, local propositional resizing is equivalent to saying that for each universe level one can construct a type of all propositions for the type judgment :
More generally, one can speak of local propositional resizing of universe hierarchies as actual structure in a dependent type theory.
Let be a hierarchy of weakly Tarski universes. By definition, is a preorder and there is a function
which states that for all terms and implies the type of embeddings is pointed. We thus have a natural map
which is the restriction of the above function to small propositions of the universe.
The axiom of local propositional resizing states that for all terms there is a -small type which is equivalent to the type of all -small propositions.
The universe hierarchy is then said to be locally impredicative. However, it may still be the case that the type of propositions for two universe are not equivalent to each other, meaning that the universe hierarchy itself is not impredicative.
Usually, the hierarchy of Tarski universes is a sequential hierarchy indexed by the natural numbers .
Last revised on August 20, 2024 at 16:27:56. See the history of this page for a list of all contributions to it.