Skip to main content icon/video/no-internet

Boolean algebra is the subfield of mathematical logic devoted to operations and functions of logical variables. After a brief historical introduction, a broad idea of its main concepts, ideas, rules, and applications is given below.

Origins

In his work about the laws of thought, the English mathematician George Boole (1815–1864) showed that it is possible to represent logical thought processes using a system of binary variables: 0–1, TRUE-FALSE, and YES-NO.

As early as 3000 BCE, the Chinese emperor Fu Hi used, within a magical symbol, a set of eight trigrams, in which three binary variables yield a written representation of integers from 0 to 7 (Figure 1). Gottfried W. Leibniz (1646–1716) took inspiration from it when he laid down the basic rules of binary arithmetic (Explanation of Binary Arithmetic, 1703). He realized that he had found a way to translate logic into calculations and laid plans for the first four-operation computing engine. However, it needed Boole's work for the idea to mature, giving birth to a genuine theory—Boole's algebra—with its calculation rules, its properties, and its theorems.

Sets, (Classical) Logic, and Boolean Algebra

A specificity of this new theory is that it may be explained under three completely equivalent forms, notwithstanding their apparent differences, using set theory, elementary logic, or Boolean algebra. In a way, we have three different descriptions of the same theory, in three different languages, but allowing perfect translation between them.

Figure 1 Fu Hi Trigrams (From Ancient China)

None

Sets

“Naive set theory” uses a set of well-defined elements—its universe—and considers a series of relations and operations between those elements and subsets of this universe. For example, if the universe is the set of all national flags at some specific moment in time, one can easily imagine all kinds of subsets: flags using red, black, or both; those featuring a cross, a circle, bars, stripes; and so forth. Using red is a binary variable, with value YES (or 1) or NO (or 0) for each flag.

Although not absolutely needed for conceptual development, a visual representation using Venn diagrams can show this relationship (see Figure 2). This figure shows the flag Universe and three of its subsets, namely flags using red (R), those using black (B), and those using yellow (Y). It immediately can be seen in the diagram that each subset automatically determines its complement (flags without black, without red, or without yellow). The Italian flag (i), for example, belongs to subset R but to neither B nor Y; this can be noted as i ∊ R, i ∉ B, and i ∉ Y.

It is also possible to consider operations on subsets. The intersection (∩) of R and B is the subset of all flags using both red AND black; the union (∪) of R and B is the subset of all flags using either red OR black—or both; this is the inclusive variant of OR. One can see that the French flag (f) satisfies f ∊ R ∪ B and f ∉ R ∩ B. Finally, some subset may be totally included (⊂) within another: The set of all flags using both red and black is included in the set of all flags that merely use red. This is noted as R ∩ B ⊂ R.

...

  • Loading...
locked icon

Sign in to access this content

Get a 30 day FREE TRIAL

  • Watch videos from a variety of sources bringing classroom topics to life
  • Read modern, diverse business cases
  • Explore hundreds of books and reference titles

Sage Recommends

We found other relevant content for you on other Sage platforms.

Loading