Rel, bicategory of relations, allegory
left and right euclidean;
extensional, well-founded relations.
constructive mathematics, realizability, computability
propositions as types, proofs as programs, computational trinitarianism
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
A setoid which satisfies a structure identity principle?.
In type theory, a setoid is univalent or saturated if for all and , .
Last revised on June 6, 2022 at 14:28:27. See the history of this page for a list of all contributions to it.