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
Let be a category with finite limits. A coherent hyperdoctrine over is a functor
from the opposite category of to the category of distributive lattices, such that for every morphism in , the functor has a left adjoint satisfying
The assignment (here) of a coherent hyperdoctrine to a coherent category extends to a 2-adjunction
with the right adjoint being a full and faithful 2-functor, hence exhibiting as a reflective sub-2-category of .
(Here has as 2-morphisms those natural transformations that preserve finite products.)
This appears as (Coumans, prop. 8).
Coherent hyperdoctrines are closed under canonical extension , in that for a coherent hyperdoctrine, so is .
This appears as (Coumans, prop. 9).
The powerset functor
(sending a set to its power set and a function to the preimage-assignment) is a coherent hyperdoctrine.
Let be a coherent category. For every object the poset of subobjects is a distributive lattice.
The corresponding functor
from the opposite category of to the category of distributive lattices is called the coherent hyperdoctrine of .
Accordingly, there is a coherent hyperdoctrine associated with any coherent theory, where the objects of are lists of free variables in the theory, and the lattice assigned to them is that of propositions of the theory in this context.
Last revised on October 30, 2023 at 07:15:45. See the history of this page for a list of all contributions to it.