(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, given a Russell universe , a type is purely essentially -small if the universe has an element and an equivalence .
A type is merely essentially -small if there merely exists an element such that :
Similarly, given a Tarski universe , a type is purely essentially -small if the universe has an element and an equivalence .
A type is merely essentially -small if there merely exists an element such that :
For a single universe , propositional resizing states that the type of all h-propositions in a universe is essentially -small.
Given a Russell universe , one could make all essentially -small types actually small types by the following inference rules:
Last revised on November 27, 2023 at 16:43:58. See the history of this page for a list of all contributions to it.