nLab Boolean hyperdoctrine

Idea

A Boolean hyperdoctrine $P$ is a hyperdoctrine for lattices which are Boolean algebras

$$P \;\colon\; T^{op} \to BooleanAlgebra \,.$$

Definition

Let $C$ be a category with finite limits. A Boolean hyperdoctrine over $C$ is a functor

$$P \;\colon\; C^{op} \to BoolAlg$$

from the opposite category of $C$ to the category of Boolean algebras, such that for every morphism $f : A \to B$ in $C$, the functor $P(B) \to P(A)$ has a left adjoint $\exists_f$ and a right adjoint $\forall_f$ satisfying

1. Frobenius reciprocity;

2. Beck-Chevalley condition.

 Examples

Every Boolean category $\mathcal{C}$ is a Boolean hyperdoctrine given by the subobject poset functor $\mathrm{sub}:\mathcal{C}^{op} \to BoolAlg$.

Related concepts

category	functor	internal logic	theory	hyperdoctrine	subobject poset	coverage	classifying topos
finitely complete category	cartesian functor	cartesian logic	essentially algebraic theory
lextensive category		disjunctive logic
regular category	regular functor	regular logic	regular theory	regular hyperdoctrine	infimum-semilattice	regular coverage	regular topos
coherent category	coherent functor	coherent logic	coherent theory	coherent hyperdoctrine	distributive lattice	coherent coverage	coherent topos
geometric category	geometric functor	geometric logic	geometric theory	geometric hyperdoctrine	frame	geometric coverage	Grothendieck topos
Heyting category	Heyting functor	intuitionistic first-order logic	intuitionistic first-order theory	first-order hyperdoctrine	Heyting algebra
De Morgan Heyting category		intuitionistic first-order logic with weak excluded middle			De Morgan Heyting algebra
Boolean category		classical first-order logic	classical first-order theory	Boolean hyperdoctrine	Boolean algebra
star-autonomous category		multiplicative classical linear logic
symmetric monoidal closed category		multiplicative intuitionistic linear logic
cartesian monoidal category		fragment $\{\&, \top\}$ of linear logic
cocartesian monoidal category		fragment $\{\oplus, 0\}$ of linear logic
cartesian closed category		simply typed lambda calculus

References

A discussion of the free Boolean hyperdoctrine generated from a signature is in

• Todd Trimble, Notes on predicate logic