nLab
Boolean hyperdoctrine

natural deduction metalanguage, practical foundations

type theory (dependent, intensional, observational type theory, homotopy type theory)

logic	category theory	type theory
true	terminal object/(-2)-truncated object	h-level 0-type/unit type
false	initial object	empty type
proposition	(-1)-truncated object	h-level 1-type/h-prop
proof	generalized element	program
conjunction	product	product type
disjunction	coproduct ((-1)-truncation of)	sum type (bracket type of)
implication	internal hom	function type
negation	internal hom into initial object	function type into empty type
universal quantification	dependent product	dependent product type
existential quantification	dependent sum ((-1)-truncation of)	dependent sum type (bracket type of)
equivalence	path space object	identity type
equivalence class	quotient	quotient type
induction	colimit	inductive type, W-type, M-type
higher induction	higher colimit	higher inductive type
completely presented set	discrete object/0-truncated object	h-level 2-type/preset/h-set
set	internal 0-groupoid	Bishop set/setoid
universe	object classifier	type of types
modality	closure operator monad	modal type theory, monad (in computer science)

Idea

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

P : T^{op} \to BooleanAlgebra .

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

Revised on August 22, 2012 11:28:42 by Urs Schreiber (82.113.121.116)