Two-element Boolean algebra

In mathematics and abstract algebra, the two-element Boolean algebra is the Boolean algebra whose underlying set (or universe or carrier) B is the Boolean domain. The elements of the Boolean domain are 1 and 0 by convention, so that B = {0, 1}. Paul Halmos's name for this algebra "2" has some following in the literature, and will be employed here.

B is a partially ordered set and the elements of B are also its bounds.

An operation of arity n is a mapping from Bⁿ to B. Boolean algebra consists of two binary operations and unary complementation. The binary operations have been named and notated in various ways. Here they are called 'sum' and 'product', and notated by infix '+' and '∙', respectively. Sum and product commute and associate, as in the usual algebra of real numbers. As for the order of operations, brackets are decisive if present. Otherwise '∙' precedes '+'. Hence A ∙ B + C is parsed as (A ∙ B) + C and not as A ∙ (B + C). Complementation is denoted by writing an overbar over its argument. The numerical analog of the complement of X is 1 − X. In the language of universal algebra, a Boolean algebra is a ⟨ B , + , {\displaystyle \langle B,+,} ∙ , . . ¯ , 1 , 0 ⟩ {\displaystyle ,{\overline {..}},1,0\rangle } algebra of type ⟨ 2 , 2 , 1 , 0 , 0 ⟩ {\displaystyle \langle 2,2,1,0,0\rangle } .

Either one-to-one correspondence between {0,1} and {True,False} yields classical bivalent logic in equational form, with complementation read as NOT. If 1 is read as True, '+' is read as OR, and '∙' as AND, and vice versa if 1 is read as False. These two operations define a commutative semiring, known as the Boolean semiring.

2 can be seen as grounded in the following trivial "Boolean" arithmetic:

1 + 1 = 1 + 0 = 0 + 1 = 1 0 + 0 = 0 0 ⋅ 0 = 0 ⋅ 1 = 1 ⋅ 0 = 0 1 ⋅ 1 = 1 1 ¯ = 0 0 ¯ = 1 {\displaystyle {\begin{aligned}&1+1=1+0=0+1=1\\&0+0=0\\&0\cdot 0=0\cdot 1=1\cdot 0=0\\&1\cdot 1=1\\&{\overline {1}}=0\\&{\overline {0}}=1\end{aligned}}}

Note that:

• '+' and '∙' work exactly as in numerical arithmetic, except that 1+1=1. '+' and '∙' are derived by analogy from numerical arithmetic; simply set any nonzero number to 1.
• Swapping 0 and 1, and '+' and '∙' preserves truth; this is the essence of the duality pervading all Boolean algebras.

This Boolean arithmetic suffices to verify any equation of 2, including the axioms, by examining every possible assignment of 0s and 1s to each variable (see decision procedure).

The following equations may now be verified:

A + A = A A ⋅ A = A A + 0 = A A + 1 = 1 A ⋅ 0 = 0 A ¯ ¯ = A {\displaystyle {\begin{aligned}&A+A=A\\&A\cdot A=A\\&A+0=A\\&A+1=1\\&A\cdot 0=0\\&{\overline {\overline {A}}}=A\end{aligned}}}

Each of '+' and '∙' distributes over the other:

•   A ⋅ ( B + C ) = A ⋅ B + A ⋅ C ; {\displaystyle \ A\cdot (B+C)=A\cdot B+A\cdot C;}
•   A + ( B ⋅ C ) = ( A + B ) ⋅ ( A + C ) . {\displaystyle \ A+(B\cdot C)=(A+B)\cdot (A+C).}

That '∙' distributes over '+' agrees with elementary algebra, but not '+' over '∙'. For this and other reasons, a sum of products (leading to a NAND synthesis) is more commonly employed than a product of sums (leading to a NOR synthesis).

Each of '+' and '∙' can be defined in terms of the other and complementation:

• A ⋅ B = A ¯ + B ¯ ¯ {\displaystyle A\cdot B={\overline {{\overline {A}}+{\overline {B}}}}}
• A + B = A ¯ ⋅ B ¯ ¯ . {\displaystyle A+B={\overline {{\overline {A}}\cdot {\overline {B}}}}.}

We only need one binary operation, and concatenation suffices to denote it. Hence concatenation and overbar suffice to notate 2. This notation is also that of Quine's Boolean term schemata. Letting (X) denote the complement of X and "()" denote either 0 or 1 yields the syntax of the primary algebra of G. Spencer-Brown's Laws of Form.

A basis for 2 is a set of equations, called axioms, from which all of the above equations (and more) can be derived. There are many known bases for all Boolean algebras and hence for 2. An elegant basis notated using only concatenation and overbar is:

1.   A B C = B C A {\displaystyle \ ABC=BCA} (Concatenation commutes, associates)
2. A ¯ A = 1 {\displaystyle {\overline {A}}A=1} (2 is a complemented lattice, with an upper bound of 1)
3.   A 0 = A {\displaystyle \ A0=A} (0 is the lower bound).
4. A A B ¯ = A B ¯ {\displaystyle A{\overline {AB}}=A{\overline {B}}} (2 is a distributive lattice)

Where concatenation = OR, 1 = true, and 0 = false, or concatenation = AND, 1 = false, and 0 = true. (overbar is negation in both cases.)

If 0=1, (1)–(3) are the axioms for an abelian group.

(1) only serves to prove that concatenation commutes and associates. First assume that (1) associates from either the left or the right, then prove commutativity. Then prove association from the other direction. Associativity is simply association from the left and right combined.

This basis makes for an easy approach to proof, called "calculation" in Laws of Form, that proceeds by simplifying expressions to 0 or 1, by invoking axioms (2)–(4), and the elementary identities A A = A , A ¯ ¯ = A , 1 + A = 1 {\displaystyle AA=A,{\overline {\overline {A}}}=A,1+A=1} , and the distributive law.

De Morgan's theorem states that if one does the following, in the given order, to any Boolean function:

• Complement every variable;
• Swap '+' and '∙' operators (taking care to add brackets to ensure the order of operations remains the same);
• Complement the result,

the result is logically equivalent to what you started with. Repeated application of De Morgan's theorem to parts of a function can be used to drive all complements down to the individual variables.

A powerful and nontrivial metatheorem states that any identity of 2 holds for all Boolean algebras.^[1] Conversely, an identity that holds for an arbitrary nontrivial Boolean algebra also holds in 2. Hence all identities of Boolean algebra are captured by 2. This theorem is useful because any equation in 2 can be verified by a decision procedure. Logicians refer to this fact as "2 is decidable". All known decision procedures require a number of steps that is an exponential function of the number of variables N appearing in the equation to be verified. Whether there exists a decision procedure whose steps are a polynomial function of N falls under the P = NP conjecture.

The above metatheorem does not hold if we consider the validity of more general first-order logic formulas instead of only atomic positive equalities. As an example consider the formula (x = 0) ∨ (x = 1). This formula is always true in a two-element Boolean algebra. In a four-element Boolean algebra whose domain is the powerset of ⁠ { 0 , 1 } {\displaystyle \{0,1\}} ⁠, this formula corresponds to the statement (x = ∅) ∨ (x = {0,1}) and is false when x is ⁠ { 1 } {\displaystyle \{1\}} ⁠. The decidability for the first-order theory of many classes of Boolean algebras can still be shown, using quantifier elimination or small model property (with the domain size computed as a function of the formula and generally larger than 2).

• Boolean algebra
• Bounded set
• Lattice (order)
• Order theory

Many elementary texts on Boolean algebra were published in the early years of the computer era. Perhaps the best of the lot, and one still in print, is:

• Mendelson, Elliot, 1970. Schaum's Outline of Boolean Algebra. McGraw–Hill.

The following items reveal how the two-element Boolean algebra is mathematically nontrivial.

• Stanford Encyclopedia of Philosophy: "The Mathematics of Boolean Algebra," by J. Donald Monk.
• Burris, Stanley N., and H.P. Sankappanavar, H. P., 1981. A Course in Universal Algebra. Springer-Verlag. ISBN 3-540-90578-2.