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, or its elements can be viewed as generalized truth values. It is also a special case of a De Morgan algebra and a Kleene algebra (with involution).

Every Boolean algebra gives rise to a Boolean ring, and vice versa, with ring multiplication corresponding to conjunction or meet ∧, and ring addition to exclusive disjunction or symmetric difference (not disjunction ∨). However, the theory of Boolean rings has an inherent asymmetry between the two operators, while the axioms and theorems of Boolean algebra express the symmetry of the theory described by the duality principle.^[1]

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. The first systematic presentation of Boolean algebra and distributive lattices is owed to the 1890 Vorlesungen of 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, 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.

Definition

A Boolean algebra is a set $A$ , equipped with two binary operations $\land$ (called "meet" or "and"), $\lor$ (called "join" or "or"), a unary operation $\neg$ (called "complement" or "not") and two elements $0$ and $1$ in $A$ (called "bottom" and "top", or "least" and "greatest" element, also denoted by the symbols $⊥$ and $⊤$ , respectively), such that for all elements $a$ , $b$ and $c$ of $A$ , the following axioms hold:^[2]

$a \lor (b \lor c) = (a \lor b) \lor c$	$a \land (b \land c) = (a \land b) \land c$	associativity
$a \lor b = b \lor a$	$a \land b = b \land a$	commutativity
$a \lor (a \land b) = a$	$a \land (a \lor b) = a$	absorption
$a \lor 0 = a$	$a \land 1 = a$	identity
$a \lor (b \land c) = (a \lor b) \land (a \lor c)$	$a \land (b \lor c) = (a \land b) \lor (a \land c)$	distributivity
$a \lor \neg a = 1$	$a \land \neg a = 0$	complements

Note, however, that the absorption law and even the associativity law can be excluded from the set of axioms as they can be derived from the other axioms (see Proven properties).

A Boolean algebra with only one element is called a trivial Boolean algebra or a degenerate Boolean algebra. (In older works, some authors required $0$ and $1$ to be distinct elements in order to exclude this case.)^{[citation needed]}

It follows from the last three pairs of axioms above (identity, distributivity and complements), or from the absorption axiom, that

a = b \land a

if and only if

a \lor b = b

.

The relation $\leq$ defined by $a \leq b$ if these equivalent conditions hold, is a partial order with least element 0 and greatest element 1. The meet $a \land b$ and the join $a \lor b$ of two elements coincide with their infimum and supremum, respectively, with respect to ≤.

The first four pairs of axioms constitute a definition of a bounded lattice.

It follows from the first five pairs of axioms that any complement is unique.

The set of axioms is self-dual in the sense that if one exchanges $\lor$ with $\land$ and $0$ with $1$ in an axiom, the result is again an axiom. Therefore, by applying this operation to a Boolean algebra (or Boolean lattice), one obtains another Boolean algebra with the same elements; it is called its dual.^[3]

Examples

The simplest non-trivial Boolean algebra, the two-element Boolean algebra, has only two elements, $0$ and $1$ , and is defined by the rules:

$\land$	$0$	$1$
$0$	$0$	$0$
$1$	$0$	$1$

$\lor$	$0$	$1$
$0$	$0$	$1$
$1$	$1$	$1$

$a$	$0$	$1$
$\neg a$	$1$	$0$

It has applications in logic, interpreting $0$ as false, $1$ as true, $\land$ as and, $\lor$ as or, and $\neg$ as not. Expressions involving variables and the Boolean operations represent statement forms, and two such expressions can be shown to be equal using the above axioms if and only if the corresponding statement forms are logically equivalent.

The two-element Boolean algebra is also used for circuit design in electrical engineering;^{[note 1]} here 0 and 1 represent the two different states of one bit in a digital circuit, typically high and low voltage. Circuits are described by expressions containing variables, and two such expressions are equal for all values of the variables if and only if the corresponding circuits have the same input–output behavior. Furthermore, every possible input–output behavior can be modeled by a suitable Boolean expression.

The two-element Boolean algebra is also important in the general theory of Boolean algebras, because an equation involving several variables is generally true in all Boolean algebras if and only if it is true in the two-element Boolean algebra (which can be checked by a trivial brute force algorithm for small numbers of variables). This can for example be used to show that the following laws (Consensus theorems) are generally valid in all Boolean algebras:
- $(a \lor b) \land (\neg a \lor c) \land (b \lor c) \equiv (a \lor b) \land (\neg a \lor c)$
- $(a \land b) \lor (\neg a \land c) \lor (b \land c) \equiv (a \land b) \lor (\neg a \land c)$

The power set (set of all subsets) of any given nonempty set $S$ forms a Boolean algebra, an algebra of sets, with the two operations $\lor := \cup$ (union) and $\land := \cap$ (intersection). The smallest element 0 is the empty set and the largest element $1$ is the set $S$ itself.

After the two-element Boolean algebra, the simplest Boolean algebra is that defined by the power set of two atoms:

$\land$	$0$	$a$	$b$	$1$
$0$	$0$	$0$	$0$	$0$
$a$	$0$	$a$	$0$	$a$
$b$	$0$	$0$	$b$	$b$
$1$	$0$	$a$	$b$	$1$

$\lor$	$0$	$a$	$b$	$1$
$0$	$0$	$a$	$b$	$1$
$a$	$a$	$a$	$1$	$1$
$b$	$b$	$1$	$b$	$1$
$1$	$1$	$1$	$1$	$1$

$x$	$0$	$a$	$b$	$1$
$\neg x$	$1$	$b$	$a$	$0$

The set $A$ of all subsets of $S$ that are either finite or cofinite is a Boolean algebra and an algebra of sets called the finite–cofinite algebra. If $S$ is infinite then the set of all cofinite subsets of $S$ , which is called the Fréchet filter, is a free ultrafilter on $A$ . However, the Fréchet filter is not an ultrafilter on the power set of $S$ .
Starting with the propositional calculus with $κ$ sentence symbols, form the Lindenbaum algebra (that is, the set of sentences in the propositional calculus modulo logical equivalence). This construction yields a Boolean algebra. It is in fact the free Boolean algebra on $κ$ generators. A truth assignment in propositional calculus is then a Boolean algebra homomorphism from this algebra to the two-element Boolean algebra.
Given any linearly ordered set $L$ with a least element, the interval algebra is the smallest Boolean algebra of subsets of $L$ containing all of the half-open intervals $[a, b)$ such that $a$ is in $L$ and $b$ is either in $L$ or equal to $\infty$ . Interval algebras are useful in the study of Lindenbaum–Tarski algebras; every countable Boolean algebra is isomorphic to an interval algebra.

For any natural number $n$ , the set of all positive divisors of $n$ , defining $a \leq b$ if $a$ divides $b$ , forms a distributive lattice. This lattice is a Boolean algebra if and only if $n$ is square-free. The bottom and the top elements of this Boolean algebra are the natural numbers $1$ and $n$ , respectively. The complement of $a$ is given by $n / a$ . The meet and the join of $a$ and $b$ are given by the greatest common divisor ( $gcd$ ) and the least common multiple ( $lcm$ ) of $a$ and $b$ , respectively. The ring addition $a + b$ is given by $lcm(a, b) / gcd(a, b)$ . The picture shows an example for $n = 30$ . As a counter-example, considering the non-square-free $n = 60$ , the greatest common divisor of 30 and its complement 2 would be 2, while it should be the bottom element 1.
Other examples of Boolean algebras arise from topological spaces: if $X$ is a topological space, then the collection of all subsets of $X$ that are both open and closed forms a Boolean algebra with the operations $\lor := \cup$ (union) and $\land := \cap$ (intersection).
If $R$ is an arbitrary ring then its set of central idempotents, which is the set

A=\left\{e\in R:e^{2}=e{\text{ and ))ex=xe\;{\text{ for all ))\;x\in R\right\},

becomes a Boolean algebra when its operations are defined by

e \lor f := e + f - ef

and

e \land f := ef

.

Homomorphisms and isomorphisms

A homomorphism between two Boolean algebras $A$ and $B$ is a function $f : A \to B$ such that for all $a$ , $b$ in $A$ :

f (a \lor b) = f (a) \lor f (b)

,

f (a \land b) = f (a) \land f (b)

,

f (0) = 0

,

f (1) = 1

.

It then follows that $f (\neg a) = \neg f (a)$ for all $a$ in $A$ . The class of all Boolean algebras, together with this notion of morphism, forms a full subcategory of the category of lattices.

An isomorphism between two Boolean algebras $A$ and $B$ is a homomorphism $f : A \to B$ with an inverse homomorphism, that is, a homomorphism $g : B \to A$ such that the composition $g \circ f : A \to A$ is the identity function on $A$ , and the composition $f \circ g : B \to B$ is the identity function on $B$ . A homomorphism of Boolean algebras is an isomorphism if and only if it is bijective.

Boolean rings

Main article: Boolean ring

Every Boolean algebra $(A, \land, \lor)$ gives rise to a ring $(A, +, \cdot)$ by defining $a + b := (a \land \neg b) \lor (b \land \neg a) = (a \lor b) \land \neg(a \land b)$ (this operation is called symmetric difference in the case of sets and XOR in the case of logic) and $a \cdot b := a \land b$ . The zero element of this ring coincides with the 0 of the Boolean algebra; the multiplicative identity element of the ring is the $1$ of the Boolean algebra. This ring has the property that $a \cdot a = a$ for all $a$ in $A$ ; rings with this property are called Boolean rings.

Conversely, if a Boolean ring $A$ is given, we can turn it into a Boolean algebra by defining $x \lor y := x + y + (x \cdot y)$ and $x \land y := x \cdot y$ .^[4]^[5] Since these two constructions are inverses of each other, we can say that every Boolean ring arises from a Boolean algebra, and vice versa. Furthermore, a map $f : A \to B$ is a homomorphism of Boolean algebras if and only if it is a homomorphism of Boolean rings. The categories of Boolean rings and Boolean algebras are equivalent;^[6] in fact the categories are isomorphic.

Hsiang (1985) gave a rule-based algorithm to check whether two arbitrary expressions denote the same value in every Boolean ring. More generally, Boudet, Jouannaud, and Schmidt-Schauß (1989) gave an algorithm to solve equations between arbitrary Boolean-ring expressions. Employing the similarity of Boolean rings and Boolean algebras, both algorithms have applications in automated theorem proving.

Ideals and filters

Main articles: Ideal (order theory) and Filter (mathematics)

An ideal of the Boolean algebra $A$ is a nonempty subset $I$ such that for all $x$ , $y$ in $I$ we have $x \lor y$ in $I$ and for all $a$ in $A$ we have $a \land x$ in $I$ . This notion of ideal coincides with the notion of ring ideal in the Boolean ring $A$ . An ideal $I$ of $A$ is called prime if $I \neq A$ and if $a \land b$ in $I$ always implies $a$ in $I$ or $b$ in $I$ . Furthermore, for every $a \in A$ we have that $a \land - a = 0 \in I$ , and then if $I$ is prime we have $a \in I$ or $- a \in I$ for every $a \in A$ . An ideal $I$ of $A$ is called maximal if $I \neq A$ and if the only ideal properly containing $I$ is $A$ itself. For an ideal $I$ , if $a \notin I$ and $- a \notin I$ , then $I \cup {a}$ or $I \cup {- a}$ is contained in another proper ideal $J$ . Hence, such an $I$ is not maximal, and therefore the notions of prime ideal and maximal ideal are equivalent in Boolean algebras. Moreover, these notions coincide with ring theoretic ones of prime ideal and maximal ideal in the Boolean ring $A$ .

The dual of an ideal is a filter. A filter of the Boolean algebra $A$ is a nonempty subset $p$ such that for all $x$ , $y$ in $p$ we have $x \land y$ in $p$ and for all $a$ in $A$ we have $a \lor x$ in $p$ . The dual of a maximal (or prime) ideal in a Boolean algebra is ultrafilter. Ultrafilters can alternatively be described as 2-valued morphisms from $A$ to the two-element Boolean algebra. The statement every filter in a Boolean algebra can be extended to an ultrafilter is called the ultrafilter lemma and cannot be proven in Zermelo–Fraenkel set theory (ZF), if ZF is consistent. Within ZF, the ultrafilter lemma is strictly weaker than the axiom of choice. The ultrafilter lemma has many equivalent formulations: every Boolean algebra has an ultrafilter, every ideal in a Boolean algebra can be extended to a prime ideal, etc.

Representations

It can be shown that every finite Boolean algebra is isomorphic to the Boolean algebra of all subsets of a finite set. Therefore, the number of elements of every finite Boolean algebra is a power of two.

Stone's celebrated representation theorem for Boolean algebras states that every Boolean algebra $A$ is isomorphic to the Boolean algebra of all clopen sets in some (compact totally disconnected Hausdorff) topological space.

Axiomatics

Proven properties

UId₁		If x ∨ o = x for all x, then o = 0
Proof:		If x ∨ o = x, then
		0
	=	0 ∨ o	by assumption
	=	o ∨ 0	by Cmm₁
	=	o	by Idn₁

UId₂ [dual] If x ∧ i = x for all x, then i = 1

Idm₁		x ∨ x = x
Proof:		x ∨ x
	=	(x ∨ x) ∧ 1	by Idn₂
	=	(x ∨ x) ∧ (x ∨ ¬x)	by Cpl₁
	=	x ∨ (x ∧ ¬x)	by Dst₁
	=	x ∨ 0	by Cpl₂
	=	x	by Idn₁

Idm₂ [dual] x ∧ x = x

Bnd₁		x ∨ 1 = 1
Proof:		x ∨ 1
	=	(x ∨ 1) ∧ 1	by Idn₂
	=	1 ∧ (x ∨ 1)	by Cmm₂
	=	(x ∨ ¬x) ∧ (x ∨ 1)	by Cpl₁
	=	x ∨ (¬x ∧ 1)	by Dst₁
	=	x ∨ ¬x	by Idn₂
	=	1	by Cpl₁

Bnd₂ [dual] x ∧ 0 = 0

Abs₁		x ∨ (x ∧ y) = x
Proof:		x ∨ (x ∧ y)
	=	(x ∧ 1) ∨ (x ∧ y)	by Idn₂
	=	x ∧ (1 ∨ y)	by Dst₂
	=	x ∧ (y ∨ 1)	by Cmm₁
	=	x ∧ 1	by Bnd₁
	=	x	by Idn₂

Abs₂ [dual] x ∧ (x ∨ y) = x

UNg		If x ∨ x_n = 1 and x ∧ x_n = 0, then x_n = ¬x
Proof:		If x ∨ x_n = 1 and x ∧ x_n = 0, then
		x_n
	=	x_n ∧ 1	by Idn₂
	=	x_n ∧ (x ∨ ¬x)	by Cpl₁
	=	(x_n ∧ x) ∨ (x_n ∧ ¬x)	by Dst₂
	=	(x ∧ x_n) ∨ (¬x ∧ x_n)	by Cmm₂
	=	0 ∨ (¬x ∧ x_n)	by assumption
	=	(x ∧ ¬x) ∨ (¬x ∧ x_n)	by Cpl₂
	=	(¬x ∧ x) ∨ (¬x ∧ x_n)	by Cmm₂
	=	¬x ∧ (x ∨ x_n)	by Dst₂
	=	¬x ∧ 1	by assumption
	=	¬x	by Idn₂

DNg		¬¬x = x
Proof:		¬x ∨ x = x ∨ ¬x = 1	by Cmm₁, Cpl₁
	and	¬x ∧ x = x ∧ ¬x = 0	by Cmm₂, Cpl₂
	hence	x = ¬¬x	by UNg

A₁		x ∨ (¬x ∨ y) = 1
Proof:		x ∨ (¬x ∨ y)
	=	(x ∨ (¬x ∨ y)) ∧ 1	by Idn₂
	=	1 ∧ (x ∨ (¬x ∨ y))	by Cmm₂
	=	(x ∨ ¬x) ∧ (x ∨ (¬x ∨ y))	by Cpl₁
	=	x ∨ (¬x ∧ (¬x ∨ y))	by Dst₁
	=	x ∨ ¬x	by Abs₂
	=	1	by Cpl₁

A₂ [dual] x ∧ (¬x ∧ y) = 0

B₁		(x ∨ y) ∨ (¬x ∧ ¬y) = 1
Proof:		(x ∨ y) ∨ (¬x ∧ ¬y)
	=	((x ∨ y) ∨ ¬x) ∧ ((x ∨ y) ∨ ¬y)	by Dst₁
	=	(¬x ∨ (x ∨ y)) ∧ (¬y ∨ (y ∨ x))	by Cmm₁
	=	(¬x ∨ (¬¬x ∨ y)) ∧ (¬y ∨ (¬¬y ∨ x))	by DNg
	=	1 ∧ 1	by A₁
	=	1	by Idn₂

B₂ [dual] (x ∧ y) ∧ (¬x ∨ ¬y) = 0

C₁		(x ∨ y) ∧ (¬x ∧ ¬y) = 0
Proof:		(x ∨ y) ∧ (¬x ∧ ¬y)
	=	(¬x ∧ ¬y) ∧ (x ∨ y)	by Cmm₂
	=	((¬x ∧ ¬y) ∧ x) ∨ ((¬x ∧ ¬y) ∧ y)	by Dst₂
	=	(x ∧ (¬x ∧ ¬y)) ∨ (y ∧ (¬y ∧ ¬x))	by Cmm₂
	=	0 ∨ 0	by A₂
	=	0	by Idn₁

C₂ [dual] (x ∧ y) ∨ (¬x ∨ ¬y) = 1

DMg₁		¬(x ∨ y) = ¬x ∧ ¬y
Proof:		by B₁, C₁, and UNg

DMg₂ [dual] ¬(x ∧ y) = ¬x ∨ ¬y

D₁		(x∨(y∨z)) ∨ ¬x = 1
Proof:		(x ∨ (y ∨ z)) ∨ ¬x
	=	¬x ∨ (x ∨ (y ∨ z))	by Cmm₁
	=	¬x ∨ (¬¬x ∨ (y ∨ z))	by DNg
	=	1	by A₁

D₂ [dual] (x∧(y∧z)) ∧ ¬x = 0

E₁		y ∧ (x∨(y∨z)) = y
Proof:		y ∧ (x ∨ (y ∨ z))
	=	(y ∧ x) ∨ (y ∧ (y ∨ z))	by Dst₂
	=	(y ∧ x) ∨ y	by Abs₂
	=	y ∨ (y ∧ x)	by Cmm₁
	=	y	by Abs₁

E₂ [dual] y ∨ (x∧(y∧z)) = y

F₁		(x∨(y∨z)) ∨ ¬y = 1
Proof:		(x ∨ (y ∨ z)) ∨ ¬y
	=	¬y ∨ (x ∨ (y ∨ z))	by Cmm₁
	=	(¬y ∨ (x ∨ (y ∨ z))) ∧ 1	by Idn₂
	=	1 ∧ (¬y ∨ (x ∨ (y ∨ z)))	by Cmm₂
	=	(y ∨ ¬y) ∧ (¬y ∨ (x ∨ (y ∨ z)))	by Cpl₁
	=	(¬y ∨ y) ∧ (¬y ∨ (x ∨ (y ∨ z)))	by Cmm₁
	=	¬y ∨ (y ∧ (x ∨ (y ∨ z)))	by Dst₁
	=	¬y ∨ y	by E₁
	=	y ∨ ¬y	by Cmm₁
	=	1	by Cpl₁

F₂ [dual] (x∧(y∧z)) ∧ ¬y = 0

G₁		(x∨(y∨z)) ∨ ¬z = 1
Proof:		(x ∨ (y ∨ z)) ∨ ¬z
	=	(x ∨ (z ∨ y)) ∨ ¬z	by Cmm₁
	=	1	by F₁

G₂ [dual] (x∧(y∧z)) ∧ ¬z = 0

H₁		¬((x∨y)∨z) ∧ x = 0
Proof:		¬((x ∨ y) ∨ z) ∧ x
	=	(¬(x ∨ y) ∧ ¬z) ∧ x	by DMg₁
	=	((¬x ∧ ¬y) ∧ ¬z) ∧ x	by DMg₁
	=	x ∧ ((¬x ∧ ¬y) ∧ ¬z)	by Cmm₂
	=	(x ∧ ((¬x ∧ ¬y) ∧ ¬z)) ∨ 0	by Idn₁
	=	0 ∨ (x ∧ ((¬x ∧ ¬y) ∧ ¬z))	by Cmm₁
	=	(x ∧ ¬x) ∨ (x ∧ ((¬x ∧ ¬y) ∧ ¬z))	by Cpl₂
	=	x ∧ (¬x ∨ ((¬x ∧ ¬y) ∧ ¬z))	by Dst₂
	=	x ∧ (¬x ∨ (¬z ∧ (¬x ∧ ¬y)))	by Cmm₂
	=	x ∧ ¬x	by E₂
	=	0	by Cpl₂

H₂ [dual] ¬((x∧y)∧z) ∨ x = 1

I₁		¬((x∨y)∨z) ∧ y = 0
Proof:		¬((x ∨ y) ∨ z) ∧ y
	=	¬((y ∨ x) ∨ z) ∧ y	by Cmm₁
	=	0	by H₁

I₂ [dual] ¬((x∧y)∧z) ∨ y = 1

J₁		¬((x∨y)∨z) ∧ z = 0
Proof:		¬((x ∨ y) ∨ z) ∧ z
	=	(¬(x ∨ y) ∧ ¬z) ∧ z	by DMg₁
	=	z ∧ (¬(x ∨ y) ∧ ¬z)	by Cmm₂
	=	z ∧ ( ¬z ∧ ¬(x ∨ y))	by Cmm₂
	=	0	by A₂

J₂ [dual] ¬((x∧y)∧z) ∨ z = 1

K₁		(x ∨ (y ∨ z)) ∨ ¬((x ∨ y) ∨ z) = 1
Proof:		(x∨(y∨z)) ∨ ¬((x ∨ y) ∨ z)
	=	(x∨(y∨z)) ∨ (¬(x ∨ y) ∧ ¬z)	by DMg₁
	=	(x∨(y∨z)) ∨ ((¬x ∧ ¬y) ∧ ¬z)	by DMg₁
	=	((x∨(y∨z)) ∨ (¬x ∧ ¬y)) ∧ ((x∨(y∨z)) ∨ ¬z)	by Dst₁
	=	(((x∨(y∨z)) ∨ ¬x) ∧ ((x∨(y∨z)) ∨ ¬y)) ∧ ((x∨(y∨z)) ∨ ¬z)	by Dst₁
	=	(1 ∧ 1) ∧ 1	by D₁,F₁,G₁
	=	1	by Idn₂

K₂ [dual] (x ∧ (y ∧ z)) ∧ ¬((x ∧ y) ∧ z) = 0

L₁		(x ∨ (y ∨ z)) ∧ ¬((x ∨ y) ∨ z) = 0
Proof:		(x ∨ (y ∨ z)) ∧ ¬((x ∨ y) ∨ z)
	=	¬((x∨y)∨z) ∧ (x ∨ (y ∨ z))	by Cmm₂
	=	(¬((x∨y)∨z) ∧ x) ∨ (¬((x∨y)∨z) ∧ (y ∨ z))	by Dst₂
	=	(¬((x∨y)∨z) ∧ x) ∨ ((¬((x∨y)∨z) ∧ y) ∨ (¬((x∨y)∨z) ∧ z))	by Dst₂
	=	0 ∨ (0 ∨ 0)	by H₁,I₁,J₁
	=	0	by Idn₁

L₂ [dual] (x ∧ (y ∧ z)) ∨ ¬((x ∧ y) ∧ z) = 1

Ass₁		x ∨ (y ∨ z) = (x ∨ y) ∨ z
Proof:		by K₁, L₁, UNg, DNg

Ass₂ [dual] x ∧ (y ∧ z) = (x ∧ y) ∧ z

Abbreviations
UId	Unique Identity
Idm	Idempotence
Bnd	Boundaries
Abs	Absorption law
UNg	Unique Negation
DNg	Double negation
DMg	De Morgan's Law
Ass	Associativity

Huntington 1904 Boolean algebra axioms

Idn₁

x ∨ 0 = x

Idn₂

x ∧ 1 = x

Cmm₁

x ∨ y = y ∨ x

Cmm₂

x ∧ y = y ∧ x

Dst₁

x ∨ (y∧z) = (x∨y) ∧ (x∨z)

Dst₂

x ∧ (y∨z) = (x∧y) ∨ (x∧z)

Cpl₁

x ∨ ¬x = 1

Cpl₂

x ∧ ¬x = 0

Abbreviations
Idn	Identity
Cmm	Commutativity
Dst	Distributivity
Cpl	Complements

The first axiomatization of Boolean lattices/algebras in general was given by the English philosopher and mathematician Alfred North Whitehead in 1898.^[7]^[8] It included the above axioms and additionally $x \lor 1 = 1$ and $x \land 0 = 0$ . In 1904, the American mathematician Edward V. Huntington (1874–1952) gave probably the most parsimonious axiomatization based on $\land$ , $\lor$ , $\neg$ , even proving the associativity laws (see box).^[9] He also proved that these axioms are independent of each other.^[10] In 1933, Huntington set out the following elegant axiomatization for Boolean algebra.^[11] It requires just one binary operation $+$ and a unary functional symbol $n$ , to be read as 'complement', which satisfy the following laws:

Commutativity: $x + y = y + x$ .
Associativity: $(x + y) + z = x + (y + z)$ .
Huntington equation: $n (n (x) + y) + n (n (x) + n (y)) = x$ .

Herbert Robbins immediately asked: If the Huntington equation is replaced with its dual, to wit:

Robbins Equation: $n (n (x + y) + n (x + n (y))) = x$ ,

do (1), (2), and (4) form a basis for Boolean algebra? Calling (1), (2), and (4) a Robbins algebra, the question then becomes: Is every Robbins algebra a Boolean algebra? This question (which came to be known as the Robbins conjecture) remained open for decades, and became a favorite question of Alfred Tarski and his students. In 1996, William McCune at Argonne National Laboratory, building on earlier work by Larry Wos, Steve Winker, and Bob Veroff, answered Robbins's question in the affirmative: Every Robbins algebra is a Boolean algebra. Crucial to McCune's proof was the computer program EQP he designed. For a simplification of McCune's proof, see Dahn (1998).

Further work has been done for reducing the number of axioms; see Minimal axioms for Boolean algebra.

Generalizations

Algebraic structures
Group-like Group Semigroup / Monoid Rack and quandle Quasigroup and loop Abelian group Magma Lie group Group theory
Ring-like Ring Rng Semiring Near-ring Commutative ring Domain Integral domain Field Division ring Lie ring Ring theory
Lattice-like Lattice Semilattice Complemented lattice Total order Heyting algebra Boolean algebra Map of lattices Lattice theory
Module-like Module Group with operators Vector space Linear algebra
Algebra-like Algebra Associative Non-associative Composition algebra Lie algebra Graded Bialgebra Hopf algebra
v t e

Removing the requirement of existence of a unit from the axioms of Boolean algebra yields "generalized Boolean algebras". Formally, a distributive lattice $B$ is a generalized Boolean lattice, if it has a smallest element $0$ and for any elements $a$ and $b$ in $B$ such that $a \leq b$ , there exists an element $x$ such that $a \land x = 0$ and $a \lor x = b$ . Defining $a \ b$ as the unique $x$ such that $(a \land b) \lor x = a$ and $(a \land b) \land x = 0$ , we say that the structure $(B, ∧, ∨, \, 0)$ is a generalized Boolean algebra, while $(B, \lor, 0)$ is a generalized Boolean semilattice. Generalized Boolean lattices are exactly the ideals of Boolean lattices.

A structure that satisfies all axioms for Boolean algebras except the two distributivity axioms is called an orthocomplemented lattice. Orthocomplemented lattices arise naturally in quantum logic as lattices of closed linear subspaces for separable Hilbert spaces.

Notes

References

External links

Order theory

Order theory
Topics Glossary Category
Key concepts	Binary relation Boolean algebra Cyclic order Lattice Partial order Preorder Total order Weak ordering
Results	Boolean prime ideal theorem Cantor–Bernstein theorem Cantor's isomorphism theorem Dilworth's theorem Dushnik–Miller theorem Hausdorff maximal principle Knaster–Tarski theorem Kruskal's tree theorem Laver's theorem Mirsky's theorem Szpilrajn extension theorem Zorn's lemma
Properties & Types (list)	Antisymmetric Asymmetric Boolean algebra topics Completeness Connected Covering Dense Directed (Partial) Equivalence Foundational Heyting algebra Homogeneous Idempotent Lattice Bounded Complemented Complete Distributive Join and meet Reflexive Partial order Chain-complete Graded Eulerian Strict Prefix order Preorder Total Semilattice Semiorder Symmetric Total Tolerance Transitive Well-founded Well-quasi-ordering (Better) (Pre) Well-order
Constructions	Composition Converse/Transpose Lexicographic order Linear extension Product order Reflexive closure Series-parallel partial order Star product Symmetric closure Transitive closure
Topology & Orders	Alexandrov topology & Specialization preorder Ordered topological vector space Normal cone Order topology Order topology Topological vector lattice Banach Fréchet Locally convex Normed
Related	Antichain Cofinal Cofinality Comparability Graph Duality Filter Hasse diagram Ideal Net Subnet Order morphism Embedding Isomorphism Order type Ordered field Ordered vector space Partially ordered Positive cone Riesz space Upper set Young's lattice