Boolean algebra

A Boolean algebra is a form of logical calculus with two binary operations AND (multiplication, •) and OR (addition, +) and one unary operation NOT (negation, ~) that reverses the truth value of any statement. Boolean algebra can be used to analyze computer chips and switching circuits, as well as logical propositions.

Boolean algebra is not a portion of elementary algebra as taught in secondary schools, and is only a facet of algebra, the general mathematical discipline treating variables, symbols and sets.

Boolean algebra has strong connections to the propositional calculus, which relates the truth value of a conclusion to the truth value of the propositions upon which it is based. However, this is only a small, and unusually simple branch of modern mathematical logic.

History

Boolean algebra was introduced in 1854 by George Boole in his book An Investigation of the Laws of Thought. This algebra was shown in 1938 by Claude Elwood Shannon to be useful in the design of logic circuits.

Axioms

The operations of a Boolean algebra, namely, two binary operations on a set A, named AND (multiplication, •) and OR (addition, +), and one unary operation NOT (negation, ~), are supplemented by two distinguished elements, namely 0 (called zero) and 1 (called one) that satisfy the following axioms for any subsets p, q, r of the set A:

${\begin{aligned}\sim 0=1\quad ;&\ \sim 1=0\ \\p\cdot 0=0\quad ;&\ p\ +\ 1=1\ \\p\cdot 1=p\quad ;&\ p\ +\ 0=p\quad \quad \quad \quad \quad {\text{ Identity laws}}\\p\ \cdot (\sim p)=0\quad ;&\ p\ +\ (\sim p)=1\quad \quad \quad {\text{ Complement laws}}\ \\\sim (\sim p)=p\ ;&\\p\cdot p=p\quad ;&\ p\ +\ p=p\ \\\sim (p\cdot q)=(\sim p)\ +\ (\sim q)\quad ;&\ \sim (p\ +\ q)=(\sim p)\ \cdot \ (\sim q)\quad {\text{ De Morgan laws}}\\p\cdot q=q\cdot p\quad ;&\ p\ +\ q=q\ +\ p\quad \quad \quad \quad \quad \quad \quad {\text{ Commutative laws}}\ \\p\cdot (q\cdot r)=(p\cdot q)\cdot r\quad ;&\ p\ +\ (q\ +\ r)=(p\ +\ q)\ +\ r\quad \quad \ {\text{ Associative laws}}\\p\cdot \left(q\ +\ r\right)=\left(p\cdot q\right)\ +\ \left(p\cdot r\right)\quad ;&\ p\ +\ \left(q\cdot r\right)\ =\left(p\ +\ q\right)\cdot \left(p\ +\ r\right)\quad {\text{ Distributive laws}}\\\end{aligned}}$

The above axioms are redundant, and all can be proven using only the identity, complement, commutative and distributive laws. The distributive law:

$\ p\ +\ \left(q\cdot r\right)\ =\left(p\ +\ q\right)\cdot \left(p\ +\ r\right)\ ,$

may seem at variance with the laws for elementary algebra, which would state:

$\left(p\ +\ q\right)\cdot \left(p\ +\ r\right)=p\cdot p\ +\ p\cdot r\ +\ q\cdot p\ +\ q\cdot r\ .$

However, this expression is equivalent within the Boolean axioms above. From the other axioms, p·p = p. Also, p·r + q·p = p·(q + r). This set lies within p, so intuitively p + p·(q + r) = p. Using the Boolean axioms instead of intuition, p + p·(q + r) = p·(1 + q + r) and according to the properties of ‘1’, (1 + q + r) = 1. Thus, the elementary algebraic result, when interpreted in terms of the Boolean axioms, reduces to the Boolean distributive law.

Alternative notations

Some alternative notations for the operations of Boolean algebra include the following:

${\mathit {AND:}}\quad \ A\cdot B,\ A\land B,\ A$ && $B,\ A$ & $B,\ A\cap B$

${\begin{aligned}{\mathit {OR:}}&\quad A+B,\ A\lor B,\ A{\mathit {||}}B,\ A|B,\ A\cup B\\{\mathit {NOT:}}&\quad \sim A,\ {\overline {A}},\ \ A',\ \neg A,\ !A\\\end{aligned}}$

Venn diagrams

(PD) Image: John R. Brews
Interpretation of Boolean operations using Venn diagrams.

Venn diagrams provide a graphical visualization of the Boolean operations. The intersection of two sets A∩B plays the role of the AND operation and the union of two sets A∪B represents the OR function, as shown by gray shaded areas in the figure. To introduce the NOT operation, the universal set is represented by the rectangle, so ~A is the set of everything not included in A, corresponding to the gray portion of the rectangle in the third panel on the left.

These diagrams provide a visualization of the Boolean axioms as well. For example, the depiction of ~(A∩B) is readily seen to be the same as (~A)∪(~B), as required by the De Morgan axiom.

Truth tables

A truth table for a logical proposition is a formal way to find whether a conclusion is valid or invalid, with ‘0’ corresponding to "invalid" and ‘1’ to "valid". In the context of Boolean algebra, attention is focused upon Boolean functions, denoted f(A, B, C), where variables A, B, C and function f are allowed values ‘1’ or ‘0’ according as the statements they correspond to are valid or invalid. The truth table for f is simply a tabulation of the values of f for all possible values of A, B, C. For example, suppose:

$f=\sim \!A+B\cdot C\ .$

The corresponding truth table is below at the left:

(PD) Image: John R. Brews
Venn diagram for f = ~A + B·C.

f = ~A + B·C

A	B	C	f=~A + B·C
0	0	0	1
0	0	1	1
0	1	0	1
0	1	1	1
1	0	0	0
1	0	1	0
1	1	0	0
1	1	1	1

The truth table can be set in correspondence with a Venn diagram, as shown to the right. The truth table entry ‘0’ under column A is interpreted as a set of points not in A, while an entry of ‘1’ is taken to refer to points that are contained in A. In the diagram, the notation Ā for ~A is used to keep labeling compact, and the ‘·’ for intersection is omitted. Labels designate the regions with boundaries surrounding the label, so label ABC denotes the region common to all three sets A, B and C. The colored area encompasses all points corresponding to f = 1, that is all points in the region ~A + B·C, while the white space corresponds to areas outside this region.

In effect, A, B, C are the statements:

• A: Point p is in set A
• B: Point p is in set B
• C: Point p is in set C

and proposition f is:

• f: Point p is either common to sets B and C or not in set A.

The truth table and the Venn diagram decide the validity of f for all choices for validity of A, B, and C.

The Boolean function f can be used with other statements that are closer to everyday language, for example, by substituting concrete entities for the various sets.

• A : The set of smart people
• B : The set of politicians
• C : The set of crooks

Then should Bill be smart and a crooked politician (A·B·C), he would fall into the group f:

• f : ~A + B·C,

a combination of stupid people and crooked politicians (of any capacity), making Bill a Democrat or a Republican, a Liberal or a Conservative, depending upon the country, the speaker and the epoch.

Extension to logic

The above discussion outlines a method for describing various sets and their subsets, and provides a formal system for deciding when different descriptions of a subset are equivalent. The application of this system to the analysis of logical arguments requires connections, sometimes called conditionals, to constructions such as "if A, then B". Assuming the statements A and B are either true ‘1’ or false ‘0’ the conditional "implies", denoted by ‘→’ can be defined by the truth table:

A → B

A	B	A → B
0	0	1
0	1	1
1	0	0
1	1	1

In other words, A → B is false when and only when A is true and B is false. This truth table is the same as ~A + B. As an example, we could take:

• A: The ball is tossed.
• B: The dog runs.

Then A → B means the dog always runs when the ball is tossed, but the dog may run otherwise as well, or not.

The biconditional "equivalence" denoted by ‘↔’ can be defined by the truth table:

A ↔ B

A	B	A ↔ B
0	0	1
0	1	0
1	0	0
1	1	1

Thus, A ↔ B has the same truth table as (A → B)•(B → A). As an example, we could take:

• A: The switch is closed.
• B: The light is on.

Then A ↔ B means the light is on if, and only if, the switch is closed. As this example shows, formal logic, like all mathematics, has to be related carefully to reality, and ignoring fuses and burned-out bulbs may or may not be an adequate model for the real situation.

With the connections to the implication and equivalence relations between antecedents A and consequents B, logical constructions can be analyzed. What can be accomplished is to determine whether various combinations of statements imply or are equivalent to various other combinations of statements; provided, of course, that the statements involved are individually either true or false.

A practical application of this formalism is to switching arrays and logic circuits, where the equivalence of different networks can be established, enabling the selection of the simplest implementation for a chosen function.