Editing Boolean algebra (structure) (section)

== History ==
<!-- [[Boolean algebra (history)]] redirects here -->

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 [[Sir William Hamilton, 9th Baronet|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]]. The first systematic presentation of Boolean algebra and [[distributive lattice]]s is owed to the 1890 ''Vorlesungen'' of [[Ernst Schröder (mathematician)|Ernst Schröder]]. 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 V. 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 (mathematician)|Paul Cohen]], [[Dana Scott]], and others found deep new results in [[mathematical logic]] and [[axiomatic set theory]] using offshoots of Boolean algebra, namely [[forcing (mathematics)|forcing]] and [[Boolean-valued model]]s.