In
mathematics and
mathematical logic,
Boolean algebra is the branch of
algebra in which the values of the
variables are the
truth values true and
false, usually denoted 1 and 0 respectively. Instead of
elementary algebra where the values of the variables are numbers, and the prime operations are addition and multiplication, the main operations of Boolean algebra are the
conjunction and denoted as the
disjunction or denoted as ∨, and the
negation not denoted as. It is thus a formalism for describing logical relations in the same way that ordinary algebra describes numeric relations.
HISTORY:
VALUES:
Whereas in elementary algebra expressions denote mainly
numbers, in Boolean algebra they denote the
truth values false and
true. These values are represented with the
bits (or binary digits), namely 0 and 1. They do not behave like the
integers 0 and 1, for which 1 + 1 = 2, but may be identified with the elements of the
two-element field GF(2), that is,
integer arithmetic modulo 2, for which 1 + 1 = 0. Addition and multiplication then play the Boolean roles of XOR (exclusive-or) and AND (conjunction) respectively, with disjunction
x∨
y (inclusive-or) definable as
x +
y +
xy.
Boolean algebra also deals with
functions which have their values in the set {0, 1}. A
sequence of bits is a commonly used such function. Another common example is the subsets of a set
E: to a subset
F of
E is associated the
indicator function that takes the value 1 on
F and 0 outside
F. The most general example is the elements of a
Boolean algebra, with all of the foregoing being instances thereof.
As with elementary algebra, the purely equational part of the theory may be developed without considering explicit values for the variables.
Basic operations
The basic operations of Boolean calculus are as follows.
- AND (conjunction), denoted x∧y (sometimes x AND y or Kxy), satisfies x∧y = 1 if x = y = 1 and x∧y = 0 otherwise.
- OR (disjunction), denoted x∨y (sometimes x OR y or Axy), satisfies x∨y = 0 if x = y = 0 and x∨y = 1 otherwise.
- NOT (negation), denoted ¬x (sometimes NOT x, Nx or !x), satisfies ¬x = 0 if x = 1 and ¬x = 1 if x = 0.
Alternatively the values of
x∧
y,
x∨
y, and ¬
x can be expressed by tabulating their values with
truth tables as follows.
| | | |
0 | 0 | 0 | 0 |
1 | 0 | 0 | 1 |
0 | 1 | 0 | 1 |
1 | 1 | 1 | 1 |
|
| |
0 | 1 |
1 | 0 |
|
If the truth values 0 and 1 are interpreted as integers, these operations may be expressed with the ordinary operations of arithmetic, or by the minimum/maximum functions:
One may consider that only the negation and one of the two other operations are basic, because of the following identities that allow to define the conjunction in terms of the negation and the disjunction, and vice versa:
Secondary operations[edit]
The three Boolean operations described above are referred to as basic, meaning that they can be taken as a basis for other Boolean operations that can be built up from them by composition, the manner in which operations are combined or compounded. Operations composed from the basic operations include the following examples:
These definitions give rise to the following truth tables giving the values of these operations for all four possible inputs.
| | | | |
0 | 0 | 1 | 0 | 1 |
1 | 0 | 0 | 1 | 0 |
0 | 1 | 1 | 1 | 0 |
1 | 1 | 1 | 0 | 1 |
The first operation,
x →
y, or C
xy, is called
material implication. If
x is true then the value of
x →
y is taken to be that of
y. But if
x is false then the value of
y can be ignored; however the operation must return
some truth value and there are only two choices, so the return value is the one that entails less, namely
true. (
Relevance logic addresses this by viewing an implication with a
false premise as something other than either true or false.)
The second operation,
x ⊕
y, or J
xy, is called
exclusive or (often abbreviated as XOR) to distinguish it from disjunction as the inclusive kind. It excludes the possibility of both
x and
y. Defined in terms of arithmetic it is addition mod 2 where 1 + 1 = 0.
The third operation, the complement of exclusive or, is equivalence or Boolean equality: x ≡ y, or Exy, is true just when x and y have the same value. Hence x ⊕ y as its complement can be understood as x ≠ y, being true just when x and y are different. Equivalence counterpart in arithmetic mod 2 is x + y + 1.
Given two operands, each with two possible values, there are 2
2 = 4 possible combinations of inputs. Because each output can have two possible values, there are a total of 2
4 =
16 possible binary Boolean operations.
Laws
A
law of Boolean algebra is an
identity such as
x∨(
y∨
z) = (
x∨
y)∨
z between two Boolean terms, where a
Boolean term is defined as an expression built up from variables and the constants 0 and 1 using the operations ∧, ∨, and ¬. The concept can be extended to terms involving other Boolean operations such as ⊕, →, and ≡, but such extensions are unnecessary for the purposes to which the laws are put. Such purposes include the definition of a
Boolean algebra as any
model of the Boolean laws, and as a means for deriving new laws from old as in the derivation of
x∨(
y∧
z) =
x∨(
z∧
y) from
y∧
z =
z∧
y as treated in the section on
axiomatization.
Monotone laws
Boolean algebra satisfies many of the same laws as ordinary algebra when one matches up ∨ with addition and ∧ with multiplication. In particular the following laws are common to both kinds of algebra:
[13]
Associativity of : | | | |
Associativity of : | | | |
Commutativity of : | | | |
Commutativity of : | | | |
Distributivity of over : | | | |
Identity for : | | | |
Identity for : | | | |
Annihilator for : | | | |
The following laws hold in Boolean Algebra, but not in ordinary algebra:
Annihilator for : | | | |
Idempotence of : | | | |
Idempotence of : | | | |
Absorption 1: | | | |
Absorption 2: | | | |
Distributivity of over : | | | |
|
Taking x = 2 in the third law above shows that it is not an ordinary algebra law, since 2×2 = 4. The remaining five laws can be falsified in ordinary algebra by taking all variables to be 1, for example in Absorption Law 1 the left hand side would be 1(1+1) = 2 while the right hand side would be 1, and so on.
All of the laws treated so far have been for conjunction and disjunction. These operations have the property that changing either argument either leaves the output unchanged or the output changes in the same way as the input. Equivalently, changing any variable from 0 to 1 never results in the output changing from 1 to 0. Operations with this property are said to be monotone. Thus the axioms so far have all been for monotonic Boolean logic. Nonmonotonicity enters via complement as follows.
Applications[edit]
Boolean algebra as the calculus of two values is fundamental to computer circuits, computer programming, and mathematical logic, and is also used in other areas of mathematics such as set theory and statistics.
[3]
Computers[edit]
In the early 20th century, several electrical engineers intuitively recognized that Boolean algebra was analogous to the behavior of certain types of electrical circuits.
Claude Shannon formally proved such behavior was logically equivalent to Boolean algebra in his 1937 master's thesis,
A Symbolic Analysis of Relay and Switching Circuits.
Today, all modern general purpose
computers perform their functions using two-value Boolean logic; that is, their electrical circuits are a physical manifestation of two-value Boolean logic. They achieve this in various ways: as voltages on wires in high-speed circuits and capacitive storage devices, as orientations of a magnetic domain in ferromagnetic storage devices, as holes in punched cards or paper tape, and so on. (Some early computers used decimal circuits or mechanisms instead of two-valued logic circuits.)
Of course, it is possible to code more than two symbols in any given medium. For example, one might use respectively 0, 1, 2, and 3 volts to code a four-symbol alphabet on a wire, or holes of different sizes in a punched card. In practice, the tight constraints of high speed, small size, and low power combine to make noise a major factor. This makes it hard to distinguish between symbols when there are several possible symbols that could occur at a single site. Rather than attempting to distinguish between four voltages on one wire, digital designers have settled on two voltages per wire, high and low.
Computers use two-value Boolean circuits for the above reasons. The most common computer architectures use ordered sequences of Boolean values, called bits, of 32 or 64 values, e.g. 01101000110101100101010101001011. When programming in
machine code,
assembly language, and certain other
programming languages, programmers work with the low-level digital structure of the
data registers. These registers operate on voltages, where zero volts represents Boolean 0, and a reference voltage (often +5V, +3.3V, +1.8V) represents Boolean 1. Such languages support both numeric operations and logical operations. In this context, "numeric" means that the computer treats sequences of bits as
binary numbers (base two numbers) and executes arithmetic operations like add, subtract, multiply, or divide. "Logical" refers to the Boolean logical operations of disjunction, conjunction, and negation between two sequences of bits, in which each bit in one sequence is simply compared to its counterpart in the other sequence. Programmers therefore have the option of working in and applying the rules of either numeric algebra or Boolean algebra as needed. A core differentiating feature between these families of operations is the existence of the
carry operation in the first but not the second.
Two-valued logic
Other areas where two values is a good choice are the law and mathematics. In everyday relaxed conversation, nuanced or complex answers such as "maybe" or "only on the weekend" are acceptable. In more focused situations such as a court of law or theorem-based mathematics however it is deemed advantageous to frame questions so as to admit a simple yes-or-no answer—is the defendant guilty or not guilty, is the proposition true or false—and to disallow any other answer. However much of a straitjacket this might prove in practice for the respondent, the principle of the simple yes-no question has become a central feature of both judicial and mathematical logic, making two-valued logic deserving of organization and study in its own right.
A central concept of set theory is membership. Now an organization may permit multiple degrees of membership, such as novice, associate, and full. With sets however an element is either in or out. The candidates for membership in a set work just like the wires in a digital computer: each candidate is either a member or a nonmember, just as each wire is either high or low.
Algebra being a fundamental tool in any area amenable to mathematical treatment, these considerations combine to make the algebra of two values of fundamental importance to computer hardware, mathematical logic, and set theory.
Two-valued logic can be extended to
multi-valued logic, notably by replacing the Boolean domain {0, 1} with the unit interval [0,1], in which case rather than only taking values 0 or 1, any value between and including 0 and 1 can be assumed. Algebraically, negation (NOT) is replaced with 1 −
x, conjunction (AND) is replaced with multiplication (
), and disjunction (OR) is defined via
De Morgan's law. Interpreting these values as logical
truth values yields a multi-valued logic, which forms the basis for
fuzzy logic and
probabilistic logic. In these interpretations, a value is interpreted as the "degree" of truth – to what extent a proposition is true, or the probability that the proposition is true.
Boolean operations
The original application for Boolean operations was
mathematical logic, where it combines the truth values, true or false, of individual formulas.
Natural languages such as English have words for several Boolean operations, in particular conjunction (
and), disjunction (
or), negation (
not), and implication (
implies).
But not is synonymous with
and not. When used to combine situational assertions such as "the block is on the table" and "cats drink milk," which naively are either true or false, the meanings of these
logical connectives often have the meaning of their logical counterparts. However, with descriptions of behavior such as "Jim walked through the door", one starts to notice differences such as failure of commutativity, for example the conjunction of "Jim opened the door" with "Jim walked through the door" in that order is not equivalent to their conjunction in the other order, since
and usually means
and then in such cases. Questions can be similar: the order "Is the sky blue, and why is the sky blue?" makes more sense than the reverse order. Conjunctive commands about behavior are like behavioral assertions, as in
get dressed and go to school. Disjunctive commands such
love me or leave me or
fish or cut bait tend to be asymmetric via the implication that one alternative is less preferable. Conjoined nouns such as
tea and milk generally describe aggregation as with set union while
tea or milk is a choice. However context can reverse these senses, as in
your choices are coffee and tea which usually means the same as
your choices are coffee or tea (alternatives). Double negation as in "I don't not like milk" rarely means literally "I do like milk" but rather conveys some sort of hedging, as though to imply that there is a third possibility. "Not not P" can be loosely interpreted as "surely P", and although
P necessarily implies "not not
P" the converse is suspect in English, much as with
intuitionistic logic. In view of the highly idiosyncratic usage of conjunctions in natural languages, Boolean algebra cannot be considered a reliable framework for interpreting them.
Boolean operations are used in
digital logic to combine the bits carried on individual wires, thereby interpreting them over {0,1}. When a vector of
n identical binary gates are used to combine two bit vectors each of
n bits, the individual bit operations can be understood collectively as a single operation on values from a
Boolean algebra with 2
n elements.
Naive set theory interprets Boolean operations as acting on subsets of a given set
X. As we saw earlier this behavior exactly parallels the coordinate-wise combinations of bit vectors, with the union of two sets corresponding to the disjunction of two bit vectors and so on.
The 256-element free Boolean algebra on three generators is deployed in
computer displays based on
raster graphics, which use
bit blit to manipulate whole regions consisting of
pixels, relying on Boolean operations to specify how the source region should be combined with the destination, typically with the help of a third region called the
mask. Modern
video cards offer all 2
23 = 256 ternary operations for this purpose, with the choice of operation being a one-byte (8-bit) parameter. The constants SRC = 0xaa or 10101010, DST = 0xcc or 11001100, and MSK = 0xf0 or 11110000 allow Boolean operations such as (SRC^DST)&MSK (meaning XOR the source and destination and then AND the result with the mask) to be written directly as a constant denoting a byte calculated at compile time, 0x60 in the (SRC^DST)&MSK example, 0x66 if just SRC^DST, etc. At run time the video card interprets the byte as the raster operation indicated by the original expression in a uniform way that requires remarkably little hardware and which takes time completely independent of the complexity of the expression.
Solid modeling systems for
computer aided design offer a variety of methods for building objects from other objects, combination by Boolean operations being one of them. In this method the space in which objects exist is understood as a set
S of
voxels (the three-dimensional analogue of pixels in two-dimensional graphics) and shapes are defined as subsets of
S, allowing objects to be combined as sets via union, intersection, etc. One obvious use is in building a complex shape from simple shapes simply as the union of the latter. Another use is in sculpting understood as removal of material: any grinding, milling, routing, or drilling operation that can be performed with physical machinery on physical materials can be simulated on the computer with the Boolean operation
x ∧ ¬
y or
x −
y, which in set theory is set difference, remove the elements of
y from those of
x. Thus given two shapes one to be machined and the other the material to be removed, the result of machining the former to remove the latter is described simply as their set difference.