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 intensional type theory such as homotopy type theory a pregroupoid is a precategory with a family of functions for objects and and identifications and for objects and and morphisms .
Equivalently, it is a dagger precategory with identifications and for objects and and morphisms .
A pregroupoid whose sets of morphisms are all subsingletons is a symmetric proset.
A pregroupoid whose object type is a set is a strict groupoid.
A pregroupoid whose canonical functions
are equivalences of types for all objects and is a skeletal groupoid.
A pregroupoid whose canonical functions
are equivalences of types for all objects and is a univalent groupoid. Every 1-truncated type is equivalent to a univalent groupoid.
Every gaunt pregroupoid is a set.
Last revised on September 22, 2022 at 18:57:27. See the history of this page for a list of all contributions to it.