World Library  
Flag as Inappropriate
Email this Article

Monadic Boolean algebra

Article Id: WHEBN0001018197
Reproduction Date:

Title: Monadic Boolean algebra  
Author: World Heritage Encyclopedia
Language: English
Subject: Algebraic logic, Łukasiewicz–Moisil algebra, List of Boolean algebra topics, Boolean algebra, Interior algebra
Collection: Algebraic Logic, Boolean Algebra, Closure Operators
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Monadic Boolean algebra

In abstract algebra, a monadic Boolean algebra is an algebraic structure A with signature

〈·, +, ', 0, 1, ∃〉 of type 〈2,2,1,0,0,1〉,

where 〈A, ·, +, ', 0, 1〉 is a Boolean algebra.

The monadic/unary operator ∃ denotes the existential quantifier, which satisfies the identities (using the received prefix notation for ∃):

  • ∃0 = 0
  • xx
  • ∃(x + y) = ∃x + ∃y
  • xy = ∃(xy).

x is the existential closure of x. Dual to ∃ is the unary operator ∀, the universal quantifier, defined as ∀x := (∃x' )'.

A monadic Boolean algebra has a dual definition and notation that take ∀ as primitive and ∃ as defined, so that ∃x := (∀x ' )' . (Compare this with the definition of the dual Boolean algebra.) Hence, with this notation, an algebra A has signature 〈·, +, ', 0, 1, ∀〉, with 〈A, ·, +, ', 0, 1〉 a Boolean algebra, as before. Moreover, ∀ satisfies the following dualized version of the above identities:

  1. ∀1 = 1
  2. xx
  3. ∀(xy) = ∀xy
  4. x + ∀y = ∀(x + ∀y).

x is the universal closure of x.

Discussion

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.

See also

References

  • Paul Halmos, 1962. Algebraic Logic. New York: Chelsea.
  • ------ and Steven Givant, 1998. Logic as Algebra. Mathematical Association of America.
This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.