Proposition
Let be a Heyting algebra.
Definition. A proposition in is an element . The element represents full truth, represents falsity, and the partial order is read as “ entails .” The connectives on propositions are the Heyting algebra operations: meet (), join (), implication (), and negation ().
A proposition is distinguished from a formula by its semantic character. A formula is a syntactic object; a proposition is what a formula denotes when interpreted in a model. Formally, an interpretation of a formal language in is a function , and a proposition is any element in the image of such an interpretation.
Proposition. The set of propositions of forms a bounded distributive lattice under and , with bounds and .
Proof sketch. This is immediate from the definition of a Heyting algebra as a bounded lattice with implication.
Proposition. In a Boolean algebra ( for all ), every proposition is either or in every prime filter. In a non-Boolean Heyting algebra, there exist propositions that are neither nor in every prime filter.
Proof sketch. Prime filters of a Boolean algebra are ultrafilters, which decide every element. In a non-Boolean Heyting algebra, there exist prime filters and elements such that neither nor .
Examples.
- In a Boolean algebra , propositions are the elements of , and the logic is classical: for all .
- In the open-set lattice of a topological space , propositions are open sets. The logic is intuitionistic: an open set with witnesses the failure of excluded middle.
- In a topos, propositions are the global elements of the subobject classifier , which is a Heyting algebra encoding the topos’s internal logic.