Monadic Boolean algebra
- 〈A, ·, +, ', 0, 1, ∃〉 of type 〈2,2,1,0,0,1〉,
where 〈A, ·, +, ', 0, 1〉 is a Boolean algebra.
- ∃0 = 0
- ∃x ≥ x
- ∃(x + y) = ∃x + ∃y
- ∃x∃y = ∃(x∃y).
A monadic Boolean algebra has a dual formulation that takes ∀ as primitive and ∃ as defined, so that ∃x := (∀x ' )' . Hence the dual algebra has signature 〈A, ·, +, ', 0, 1, ∀〉, with 〈A, ·, +, ', 0, 1〉 a Boolean algebra, as before. Moreover, ∀ satisfies the following dualized version of the above identities:
- ∀1 = 1
- ∀x ≤ x
- ∀(xy) = ∀x∀y
- ∀x + ∀y = ∀(x + ∀y).
∀x is the universal closure of x.
Monadic Boolean algebras have an important connection to topology. If ∀ is interpreted as the interior operator of topology, (1)-(3) above plus the axiom ∀(∀x) = ∀x make up the axioms for an interior algebra. But ∀(∀x) = ∀x can be proved from (1)-(4). Moreover, an alternative axiomatization of monadic Boolean algebras consists of the (reinterpreted) axioms for an interior algebra, plus ∀(∀x)' = (∀x)' (Halmos 1962: 22). Hence monadic Boolean algebras are the semisimple interior/closure algebras such that:
- The universal (dually, existential) quantifier interprets the interior (closure) operator;
- All open (or closed) elements are also clopen.
A more concise axiomatization of monadic Boolean algebra is (1) and (2) above, plus ∀(x∨∀y) = ∀x∨∀y (Halmos 1962: 21). This axiomatization obscures the connection to topology.
Monadic Boolean algebras form a variety. They are to monadic predicate logic what Boolean algebras are to propositional logic, and what polyadic algebras are to first-order logic. Paul Halmos discovered monadic Boolean algebras while working on polyadic algebras; Halmos (1962) reprints the relevant papers. Halmos and Givant (1998) includes an undergraduate treatment of monadic Boolean algebra.
Monadic Boolean algebras also have an important connection to modal logic. The modal logic S5, viewed as a theory in S4, is a model of monadic Boolean algebras in the same way that S4 is a model of interior algebra. Likewise, monadic Boolean algebras supply the algebraic semantics for S5. Hence S5-algebra is a synonym for monadic Boolean algebra.
- Paul Halmos, 1962. Algebraic Logic. New York: Chelsea.
- ------ and Steven Givant, 1998. Logic as Algebra. Mathematical Association of America.
|This logic-related article is a stub. You can help Wikipedia by expanding it.|