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 homotopy type theory, a univalent groupoid or saturated groupoid is a univalent dagger category where for all objects and and morphisms , and . Equivalently, it is a univalent dagger category where every morphism is a unitary morphism.
Equivalently, a univalent or saturated groupoid is a precategory where for all objects and there is an equivalence between the identity type and the type :
where
The second definition implies that the only morphisms in are isomorphisms, making a groupoid, and thus the Rezk completeness condition holds in , making univalent.
Last revised on May 21, 2023 at 13:52:19. See the history of this page for a list of all contributions to it.