MainSocietyPhilosophyReference › The Mathematics of Boolean Algebra

The Mathematics of Boolean Algebra

Edit Page
Report
Scan day: 07 February 2014 UTC
-17
Virus safety - good
Description: Survey of the algebra of two-valued logic; by J. Donald Monk.
The Mathematics of Boolean Algebra (Stanford Encyclopedia of Philosophy) The Mathematics of Boolean Algebra First published Fri Jul 5, 2002; substantive revision Fri Feb 27, 2009 Boolean algebra is the algebra of two-valued logic with only sentential connectives, or equivalently of algebras of sets under union and complementation. The rigorous concept is that of a certain kind of algebra, analogous to the mathematical notion of a group. This concept has roots and applications in logic (Lindenbaum-Tarski algebras and model theory), set theory (fields of sets), topology (totally disconnected compact Hausdorff spaces), foundations of set theory (Boolean-valued models), measure theory (measure algebras), functional analysis (algebras of projections), and ring theory (Boolean rings).  The study of Boolean algebras has several aspects: structure theory, model theory of Boolean algebras, decidability and undecidability questions for the class of Boolean algebras, and the indicated applications. In addition, although not explained here, there are connections to other logics, subsumption as a part of special kinds of algebraic logic, finite Boolean algebras and switching circuit theory,  and Boolean matrices.
Size: 1221 chars

Contact Information

Phone&Fax:
Address:
Extended:

WEBSITE Info

Page title:The Mathematics of Boolean Algebra (Stanford Encyclopedia of Philosophy)
Keywords:
Description:
IP-address:171.67.193.20

WHOIS Info

NS
Name Servers: ARGUS.STANFORD.EDU 171.64.7.115, 2607:f6d0:0:9113::ab40:773 AVALLONE.STANFORD.EDU 171.64.7.88, 2607:f6d0:0:9116::ab40:758
WHOIS
Date
activated: 04-Oct-1985
last updated: 07-May-2009
expires: 31-Jul-2014