Boolean algebra (structure)

related topics
{math, number, function}
{work, book, publish}
{area, part, region}

In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice. This type of algebraic structure captures essential properties of both set operations and logic operations. A Boolean algebra can be seen as a generalization of a power set algebra or a field of sets.

Contents


History

The term "Boolean algebra" honors George Boole (1815–1864), a self-educated English mathematician. He introduced the algebraic system initially in a small pamphlet, The Mathematical Analysis of Logic, published in 1847 in response to an ongoing public controversy between Augustus De Morgan and William Hamilton, and later as a more substantial book, The Laws of Thought, published in 1854. Boole's formulation differs from that described above in some important respects. For example, conjunction and disjunction in Boole were not a dual pair of operations. Boolean algebra emerged in the 1860s, in papers written by William Jevons and Charles Sanders Peirce. To the 1890 Vorlesungen of Ernst Schröder the first systematic presentation of Boolean algebra and distributive lattices is owed. The first extensive treatment of Boolean algebra in English is A. N. Whitehead's 1898 Universal Algebra. Boolean algebra as an axiomatic algebraic structure in the modern axiomatic sense begins with a 1904 paper by Edward Vermilye Huntington. Boolean algebra came of age as serious mathematics with the work of Marshall Stone in the 1930s, and with Garrett Birkhoff's 1940 Lattice Theory. In the 1960s, Paul Cohen, Dana Scott, and others found deep new results in mathematical logic and axiomatic set theory using offshoots of Boolean algebra, namely forcing and Boolean-valued models.

Full article ▸

related documents
Liouville number
Positive-definite matrix
Hypercomplex number
Finite difference
Stone–Weierstrass theorem
Yoneda lemma
Morphism
Power set
Cauchy's integral formula
Even and odd permutations
Antiderivative
Blackboard bold
Julia set
Solvable group
Heapsort
Integer factorization
Polytope
Max-flow min-cut theorem
Gamma function
Separation axiom
Line integral
Topology
Tychonoff space
Supervised learning
Expander graph
LL parser
Cardinality
Algebraically closed field
Quine (computing)
Stokes' theorem