## George Boole

**-**

## Boole, George

# Boole, George

(*b*. Lioncoln, England, 1815; *d*. Cork, Ireland, 1864)

*mathematics*.

George Boole was the son of John Boole, a cobbler whose chief interests lay in mathematics and the making of optical instruments, in which his son learned to assist at an early age. The father was not a good businessman, however, and the decline in his business had a serious effect on his son’s future. The boy went to an elementary school and for a short time to a commercial school, but beyond this he educated himself, encouraged in mathematics by his father and helped in learning Latin by William Brooke, the proprietor of a large and scholarly circulating library. He acquired a knowledge of Greek, French, and German by his own efforts, and showed some promise as a classical scholar; a translation in verse of Meleager’s “Ode to the Spring” was printed in a local paper and drew comments on the precocity of a boy of fourteen. He seems to have thought of taking holy ordres, but at the age of fifteen he began teaching, soon setting up a school of his own in Lincoln.

In 1834 the Mechanics Institution was founded in Lincoln, and the president, a local squire, passed Royal Society publications on to institution’s reading room, of which John Boole became curator. George, who now devoted his scanty leisure to the study of mathematics, had access to the reading room, and grappled, almost unaided, with Newton’s *Principia* and Lagrange’s *Mécanique analytique*, gaining such a local reputation that at the age of nineteen he was asked to give an address on Newton to mark the presentation of a bust of Newton, also a Lincolnshire man, to the Institution. This address, printed in 1835, was Boole’s first scientific publication. In 1840 he began to contribute to the recently founded *Cambridge Mathematical Journal* and also to the Royal Society, which awarded him a Royal Medal in 1844 for his papers on operators in analysis; he was elected a fellow of the Royal Society in 1857.

In 1849, Boole, on the advice of friends, applied for the professorship of mathematics in the newly established Queen’s College, Cork, and was appointed in spite of his not holding any university degree. At Cork, although his teaching load was heavy, he found more time and facilities for research. In 1855 he married Mary Everest, the niece of a professor of Greek in Queen’s College and of Sir George Everest, after whom Mount Everest was named.

Boole was a clear and conscientious teacher, as his textbooks show. In 1864 his health began to fail, and his concern for his students may have hastened his death, since he walked through rain to a class and lectured in wet clothes, which led to a fatal illness.

Boole’s scientific writings consist of some fifty papers, two textbooks, and two volumes dealing with mathematical logic. The two textbooks, on differential equations (1859) and finite differences (1860), remained in use in the United Kingdom until the end of the century. They contain much of Boole’s original work, reproducing and extending material published in his research papers. In the former book, so much use is made of the differential operator *D* that the method is often referred to as Boole’s, although it is in fact much older than Boole. Both books exhibit a great technical skill in the handling of operators: in the volume on finite differences, an account is given of the operators π and ρ, first introduced in Boole’s Royal Society papers. The basic operators of this calculus, Δ and *E*, defined by his equations

Δu

_{x}= u_{x+1}−u_{x},Eu_{x}= u_{x+1};

Boole then defines his new operators by the operational equations

π =

xΔ, ρ =xE,

and shows how they can be used to solve certain types of linear difference equations with coefficients depending on the independent variable. These operators have since been generalized by L.M. Milne-Thomson.

In papers in the *Cambridge Mathematical Journal* in 1841 and 1843, Boole dealt with linear transformations. He showed that if the linear transformation

x=pX+qY,y=rX+sY

is applied to the binary quadratic form

a

x^{2}+ 2hxy+ by^{2}

to yield the binary quadratic form

AX^{2}+ 2HXY+BY^{2},

then *AB* – *H*^{2} = (*ps* – *qr*)^{2} (*ab* – *h*^{2}).

The algebraic fact had been partly perceived by Lagrange and by Gauss, but Boole’s argument drew attention to the (relative) invariance of the discrimiant ab – h^{2}, and also to the absolute invariants of the transformation. This was the starting point of the theory of invariants, so rapidly and extensively developed in the second half of the nineteenth century; Boole himself, however, took no part in this development.

Other papers dealt with differential equations, and the majority of those published after 1850 studied the theory of probability, closely connected with Boole’s work on mathematical logic. In all his writings, Boole exhibited considerable technical skill, but his facility in dealing with symbolic operators did not delude him into an undue reliance on analogy, a fault of the contemporary British school of symbolic analysis. E.H. Neville has remarked that mathematicians of that school treated operators with the most reckless disrespect, and in consequence could solve problems beyond the power not merely of their predecessors at the beginning of the century but of their inhibited successors at the end of the century, obtaining many remarkable and frequently correct formulas but ignoring conditions of validity.

Boole greatly increased the power of the operational calculus, but seldom allowed himself to be carried away by technical success: at a time when the need for precise and unambiguous definitions was often ignored, he was striving, although perhaps not always with complete success, to make his foundations secure. There is a clear and explicit, although later, statement of his position in his *Investigation of the Laws of Thought;* there are, he says, two indispensable condition for the conditions for the employment of symbolic operators: “First, that from the sense once conventionally established, we never, in the same process of reasoning, depart; secondly, that the laws by which the process is conducted be founded exclusively upon the above fixed sense or meaning of the symbols employed. “With the technical skill and the desire for logical precision there is also the beginning of the recognition of the nonnumerical variable as a genuine part of mathematics. The development of this notion in Boole’s later and most important work appears to have been stimulated almost accidentally by a logical controversy.

Sir William Hamilton, the Scottish philosopher (not to be confused with the Irish mathematician Sir William Rowan Hamilton), picked a logical quarrel with Boole’s friend Augustus De Morgan, the acute and high-minded professor of mathematics at University College, London. De Morgan’s serious, significant contributions to logic were derided by Hamilton, on the grounds that the study of mathematics was both dangerous and the useless-no mathematician could contribute anything of importance to the superior domain of logic. Boole, in the preface to his *Mathematical Analysis of Logic* (1847), demonstrated that, on Hamilton’s own principles, logic would form no part of philosophy. He asserted that in a true classification, logic should not be associated with metaphysics, but with mathematics. He then offered his essay as a construction, in symbolic terms, of logic as a doctrine, like geometry, resting upon a groundwork of acceptable axioms.

The reduction of Aristotelian logic to an algebraic calculus had been more than once attempted; Leibniz had produced a scheme of some promise. If the proposition “ALL *A* is *B*” is written in the form *A/B*, and “All *B* is *C*” in the form *B/C*, then it is tempting to remove the common factor *B* from numerator and denominator and arrive at *A/C*, to be correctly interpreted as the conclusion “All *A* is *C*.” Any attempt to extend his triviality encountered difficulties: Boole’s predecessors had tried to force the algebra of real numbers onto logic, and since they had not envisaged a plurality of algebras, it was believed that only if the elementary properties of the symbols implied formal rules identical with those of the algebra of real numbers could the subject be regarded as a valid part of mathematics. Boole recognized that he had created a new branch of mathematics, but it is not clear whether he appreciated that he had devised a new algebra. He appears not to have known that geometries other than Euclidean could be constructed; but he knew of Rowan Hamilton’s quaternion, an algebra of quadruplets in which products are noncommutative, for one of his minor papers (1848) deals with some quaternion matters. Grassmann’s similar, if more general, work in the *Ausdehnungslehre* (1844) seems to have been unknown. Boole, then, knew of an algebra similar to, but not identical with, the algebra of real numbers.

If we consider a set *U*, the universal set or the universe of discourse, often denoted by 1 in Boole’s work, subsets can be specified by elective operators *x, y, …*, so that *xU* is the subset of *U* whose elements have the property defining the operator x. Thus, if *U* is the set of inhabitants of New York, we can select those who are, say, male by an elective operator *x* and denote the set of male inhabitants of New York by *xU*. Similarly, the left-handed inhabitants of New York may be denoted by *yU*, and blue-eyed inhabitants by *zU*, and so on. The elective operators may be applied successively. Thus we may first select all the males and from these all the lefthanders by the symbolism *y(xU);* if we first select all the left-handers and from these all the males, we have the symbolism *x(yU)*. Since in each case the final set is the same, that of all left-handed males, we can write *y(xU)=x(yU)*, or, since the universe of discourse *U* is understood throughout, simply write *yx=xy*. The analogy with the commutative algebraic product is clear. The associative law for products, *x()yz=(xy)z*, can be verified at once in this interpretation, since each side denotes the set of those who are at once male, left-handed, and blue-eyed; Boole uses this without bothering to give any explicit justification. He was careful, however, to remark that although an analogy exists, the evidence on which the laws are based in his work is not related to the evidence on which the laws of the algebra of real numbers are based. To select the set of males from the set of males is merely to arrive at the set of males; thus the definition of the operator *x* leads to the idempotent law *x(xU)= xU*, or *x ^{2}=x*, the first break with ordinary algebra.

The Product or intersection operation can also be regarded as a symbolic expression of the logical concept of conjunction by means of the conjunctive “and,” since *xy* will denote the set of those inhabitants of New York who are at once male *and* left-handed.

If *xU* is the subset of males in the universal set *U*, it is natural to write the set of nonmales, that which remains when the set of males is subtracted from *U*, as *U* — *xU*, or, briefly, 1 — *x*. This set, the complement of *x* relative to *U*, which Boole for brevity denoted by x̄, can be regarded as arising from the application of the logical negation “not” to the set x. Addition has not yet been defined, but Boole did not hesitate to rewrite the equation x̄=1— x in the form x + x̄ = 1, implying that the universal set is made up of the elements of the subset x or of the subset not-x; this suggests that the sign + is the symbol for the connective “or.” But the word “or” in English usage has an inclusive and an exclusive sense:“either…or…and possibly both” and “either…or…but not both.” Boole chose the exclusive sense, and so did not allow the symbolism x+y unless the sets x, y were mutually exclusive.

Modern usage takes x + y for the union or logical sum, the set of elements belonging to at least one of x, y: this union Boole included in his symbolism as *x* + *x̄y*. Kneale suggests that Boole’ choice of the exclusive sense for the symbol + was caused by a desire to use the minus sign (-) as the inverse of the plus the inverse sign (+). If y is contained in x, x-y can consistently denote those elements of x which are not elements of y —the complement of relative to x —but if + is used in the inclusive sense, then the equations *x* = *y* + *z*, *x* = *y* + *w* do not imply *z* = *w*, so that *x* - *y* is essentially indeterminate. Alternately, a use of the idempotent law implies that

(

x-y)^{2}=x-y,

and a further application of this law suggests that from

x^{2}- 2xy+y^{2}=x - y

it follows that

x- 2xy+y=x - y

and, hence, that *y* = *xy*; this is a symbolic statement that y is a subset of x. Boole was thus led to the use of the sign + in the exclusive sense, with the sign — as its inverse.

The idempotent law *x*^{2} = *x* is expressed in the form *x*(1 – *x*) = 0, but it is not altogether clear whether Boole regarded this as a deduction or as a formulation of the fundamental Aristotelian principle that a proposition cannot be simultaneously true and false. Some of the obscurity is due to the fact that Boole does not always make clear whether he is dealing with sets, or with propositions, or with an abstract calculus of which sets and propositions are representations.

Much of the 1847 tract on the mathematical analysis of logic is devoted to symbolic expressions for the forms of the classical Aristotelian propositions and the moods of the syllogism. The universal propositions “All *X*’s are *Y*’s” “No *X*’s are *Y*’s take the forms *x*(1 - *y*) = 0, *xy* = 0. The Particular propositions “Some *X*’s are *Y*’s” “Some *X*’s” do not take what might appear to be the natural forms *xy* ≠ 0, *x*(1 - *y*) ≠ 0, possibly because Boole wished to avoid inequalities and to work entirely in terms of equations. He therefore introduced an elective symbol, ν any elements common to *x* and *y* constitute a subset ν which, he says, is “indefinite in every respect but this” — that it has some members. The two particular propositions he wrote in wrote in the forms *xy* = ν, This ill-defined symbol needs careful handling when the moods and figures of the syllogism are discussed. Thus the premises “All *Y*’s are *X*’s” “No *Z*’s are *Y*’s give the equations *y* = ν*x*, 0 = *zy*, with the inference 0= ν*zx* to be interpreted as “SomeX’ and — ν is regarded as the representation of some only with respect to the class X.”

A similar obscurity is encountered when an attempt is made to define division. If *z* = *xy*, what inferences can be drawn about *x*, in the hope of defining the quotient *z/y*? Since *z* is *y*, *yz* = *z*; thus *x*, which contains *z*, contains *yz*. Any other element of *x* that is not in *z* cannot be in *y*, and hence *x* is made up of *yz* and an indeterminate set of which all that can be said is that its elements belong neither to *y* nor to *z*, and thus belong to the intersection of 1— *y* and 1 – *z*. Thus

*z/y* = *yz* + an indefinite portion of (1- *y*) (1 - *z*)

Boole gave this result as a special case of his general expansion formula, and his argument is typical of that used to establish the general theorem. From *y+ȳ* = 1, *z+z̄*= 1, it follows that is, the universe of discorse is the sum of the subsets. Hence, any subset whatsoever will be at most a sum of elements from each of these four subsets; thus

*z/y* = *Ayz* + *Byz̄* + *Cyz̄* + *Dyz̄*,

with coefficients A, B, C, D to be determined. First, set *y* = 1, *z* = 1, so that *ȳ* = *z̄* = 0; then *A = 1*. Next, set *y* = 1, *z* = 0, so that *ȳ* = 0, *z̄* = 1; then *B* = 0. Third, set *y* = 0, *z* = 1, so that *ȳ* = 1, *z̄* = 0; if the term in yz were present, then C would have to be infinite; hence, the term in ȳz cannot appear. Finally, if *y* = *z* = 0, the coefficient *D* is of the form 0/0, which is indeterminate. This asserts the possible presence of an indefinite portion of the set *ȳz̄*. Thus, as before,

z/y=yz+ an indefinite portion of yz̄,

or, as Boole frequently wrote it,

Schröeder showed that the introduction of division is unnecessary. But the concept of the “development” of a function of the elective symbols is fundamental to Boole’s logical operations and occupies a prominent place in his great work on mathematical logic, the *Investigation of the Laws of Thought*. If *f(x)* involves *x* and the algebraic signs, then it must denote a subset of the universe of discourse and must therefore be made up of elements from *x* and *x̄*. Thus

f(x)=Ax+Bx̄,

where the coefficients *A* and *B* are determined by giving *x* the values of 0 and 1. Thus

f(x)=f(1)x+f(0)(1 -x),

which in the *Mathematical Analysis of logic* Boole regards as a special case of MacLaurin’s theorem, although he dropped this analogy in the *Investigation of the Laws of Thought*. A repeated application of this method to an expression *f(x, y)* containing two elective symbols yields

f(x,y)=f(1, 1)xy+f(1, 0)x(1-y)+

f(0, 1)(1-x)y+f(0, 0)(1-x)(1-y),

and more general formulas can be written down by induction. Logical problems which can be expressed in terms of elective symbols may then be reduced to standard forms expediting their solution.

Boole’s logical calculus is not a two-valued algebra, although the distinction is not always clearly drawn in his own work. The principles of his calculus, as a calculus of sets, are nowhere set out by him in a formal table, but are assumed, sometimes implicitly, and are, save one, analogous to the algebraic rules governing real numbers:

xy=yx

x+y=y+x

x(y+z)=xy+xz

x(y-z)=xy - xz.

If *x = y*, then

xz = yz

x + z=y + z

x - z=y - z.

x(1 -x) = 0.

Of these, only the last has no analogue in the algebra of real numbers. These principles suffice for the calculus of sets. But Boole observes that in algebra the last principle is an equation whose only roots are *x* = 0, *x* = 1. In the calculus of sets this would assert that any set is either the null set or the universal set. Boole added this numerical interpretation in order to establish a two-valued algebra, of which one representation would be a calculus of propositions in which the truth of a proposition *X* is denoted by *x* = 1 and its falsehood by *x* = 0: the truth-value of a conjunction “*X* and *Y*” will be given by *xy*, and of an exclusive disjunction “*X* or *Y*” by *x* + *y*. The distinction between propositions and propositional fonctions, not drawn by Boole, was made later by C. S. Peirce and Schröder.

The use of *x* + *y* to denote the exclusive sense of “or’ led to difficulties, such as the impossibility of interpreting 1 + *x* and *x* + *x*, which Boole surmounted with considerable ingenuity. But Jevons, in his *Pure Logic* (1864), used the plus sign in its inclusive (and/or) sense, a use followed by Venn and C. S. Peirce and since then generally adopted. Peirce and Schroder emphasized that the inclusive interpretation permits a duality between sum and product, and they also showed that the concepts of subtraction and division are superfluous and can be discarded. With the use of *x* + *y* to denote “either *x* or *y* or both,” the expression *x* + *x* presents no difficulty, being just *x*, while 1 + *x* is the universal set 1. The duality of the two operations of sum and product exemplified by the equations *xx* = *x*, *x* + *x* = *x* can now be caried further: the formulas

*xy* + *xz* = *x(y + z)*, *(x + y)(x + z)* = *x + yz*

are duals, since one can be derived from the other by an interchange of sum with product. This duality is clearer if these operations are denoted by the special symbols ⋂ ∪now in general use for product and sum, that is, for intersection and union. In this notation, the preceding equations are written

(

x∪y)⋂(x∪z) =x∪(y⋂z),(

x⋂y) ∪ (x⋂z) =x⋂ (y∪z).

With the inclusive interpretation, the system can now be shown to obey the dual rules of De Morgan:

In the *Investigation of the Laws of Thought*, the calculus is applied to the theory of probability. If *P(X) = x* is the probability of an event *X*, then if events *X, Y* are independent, *P(X and Y*) = *xy*, while if *X* and *Y* are mutually exclusive, *P(X or Y)* = *x + y*. The principles laid down above are satisfied, except for the additional numerical principal in which the allowable values of *x* are 0 and 1, which is not satisfied. A clear and precise symbolism enabled Boole to detect and correct flaws in earlier work on probability theory.

E. V. Huntington in 1904 gave a set of independent axioms on which Boole’s apparatus can be constructed, and various equivalent sets have been exhibited. One formulation postulates two binary operations (union and intersection) which have the commutative and distributive properties:

*x*∪*y* = *y*∪*x*, *x*⋂*y* = *y*⋂*x*

*x*∪(*y* ⋂*z*) = (*x*∪*y*)⋂(*x*∪*z*)

*x*⋂(*y*∪*z*) = (*x*⋂*y*)∪(*x*⋂*z*)

further, there are two distinct elements, 0 and 1, such that for all *x*

x∪0=x,x⋂l =x;

also, for any x, there is an element *x* (the complement) for which

The system so defined is self-dual, since the set of axioms remains unchanged if and are interchanged when 0, 1 are also interchanged. The associative laws for union and intersection are not required as axioms, since they can be deduced from the given set.

If intersection and complement are taken as the basic operations, with the associative law *x* ⋂(*y* ⋂*z*) = (*x* ⋂ *y*) ⋂ *z* now an axiom and the relation between the basic operations given by the statements

then union can now be defined in terms of intersection and complement by the equation

0 can be defined as *x ⋂ x̄* and 1 as the complement of 0. The two systems are then equivalent.

The theory of lattices may be regarded as a generalization. A lattice is a system with operations ∪, ⋂ having the commutative, distributive, and associative properties. Thus every Boolean algebra is a lattice; the converse is not true. The lattice concept is wider than the Boolean, and embraces interpretations for which Boolean algebra is not appropriate.

Boole’s two-valued algebra has recently been applied to the design of electric circuits containing simple switches, relays, and control elements. In particular, it has a wide field of application in the design of high-speed computers using the binary system of digital numeration.

## BIBLIOGRAPHY

I. Original Works. Boole’s papers include “Researches on the Theory of Analytical Transformations, With a Special Application to the Reduction of the General Equation of the Second Order,” in *Cambridge Mathematical Journal*, **2** (1841), 64–73; “On a General Method in Analysis,” in *philosophical Transactions of the Royal Society of London*, **134** (1844), 225–282. *An Address on the Genius and Discoveries of Sir Isaac Newton* was published in Lincoln in 1835.

His textbooks are *Treatise on Differential Equations* (Cambridge, 1859, and later editions); a posthumous *Supplementary Volume* (Cambridge, 1865), compiled from Boole’s notes by Isaac Todhunter, and containing a list of Boole’s publications; *Treatise on the calculus of Finite Differences* (Cambridge, 1860, and later editions).

On mathematical logic: *The Mathematical Analysis of Logic, Being an Essay Towards a calculus of Deducative Reasoning* (Cambridge, 1847; repr. Oxford, 1948, and in Boole’s *Collected Logical Works*, I, Chicago-London, 1916); *An Investigation of the Laws of Thought, on Which Are Founded the Mathematical Theories of Logic and Probability*(London, 1854; repr. New York, 1951, and in Boole’s *Collected Logical Works*, II, Chicago-London, 1916).

II. Secondary Literature. E. V. Huntington, “Sets of Independent Postulates for the Algebra of Logic,” in *Transactions of the American Mathematical Society*, **5** (1904), 208–309; E. V. Huntington, “Postulates for the Algebra of Logic,” in *Transactions of the American Mathematical Society*, **35** (1933), 274–304; W. Kneale, “Boole and the Revival of Logic,” in *Mind*, **57** (1948), 149–175, which contains a useful bibliography; W. Kneale, “Boole and the Algebra of Logic,” in *Notes and Records of the Royal Society of London*, **12** (1956), 53–63; Sir Geoffrey Taylor, “George Boole, 1815–1864,” *ibid*., 44–52, which gives an account of Boole’s life by his grandson.

T. A. A. Broadbent

## Boole, George

# Boole, George

*English Mathematician*

*1815–1864*

George Boole was a mathematician whose work in symbolic logic laid new foundations for modern algebra, and set the stage for contemporary computer circuitry and database search strategy **syntax** . Boole was born in Lincolnshire, England, in 1815, and he died December 8, 1864, in County Cork, Ireland. He received little in the way of formal education, but he was a dedicated reader and self-taught student of languages and mathematics.

At the age of sixteen, Boole became an assistant teacher for elementary school students. By age twenty, Boole had started his own school. Dismayed at what he considered to be inadequate materials available to teach mathematics to young students, Boole undertook the serious study of mathematics on his own. In subsequent years he wrote several seminal papers on the relationship between logic and mathematics. Despite his lack of university training and connections, he managed to get his works published in *The Cambridge Mathematical Journal,* eventually winning the professional respect of other mathematicians and logicians. In 1854 he published *An Investigation of the Laws of Thought, on Which Are Founded the Mathematical Theories of Logic and Probabilities.* Considered his most influential work, this text provides the foundation for what has become known as **Boolean algebra** . Other significant works include the *Treatise on Differential Equations* (1859) and the *Treatise on the Calculus of Finite Differences* (1860).

Boole was a deeply religious man. He was influenced by the works of Sir Isaac Newton, Joseph LaGrange, and Pierre-Simon Laplace, as well as the philosopher Gottfried Wilhelm Leibnitz. Also a family man, Boole married Mary Everest, niece of Sir George Everest, for whom Mt. Everest was named. Boole and Everest married in 1855 and eventually had five daughters: Mary, Margaret, Alicia, Lucy, and Ethel.

Boole died of pneumonia at the age of forty-nine, when Alicia was four years old and his youngest daughter was an infant. His widow, Mary Everest Boole, made significant contributions to the field of mathematics herself, carrying on her late husband's work of helping children learn mathematics. She described her work as that of a "mathematical psychologist," and focused on understanding how children use reason and logic, physical activity, and subconscious processes to learn mathematics.

## Boolean Legacies

Many mathematicians consider Boole's most significant contribution to be his Boolean algebra, which articulates a theory of relations. Boolean algebra furnishes laws of possibility among propositions. In the 1940s, early computer pioneer Claude Shannon (1916–2001) applied Boole's principles to electrical wiring and developed a mathematical theory of communication, which led to the connection between the work of George Boole and modern computer circuitry, which Boole of course could not have anticipated.

Boolean algebra is also at the center of symbolic reasoning, which is widely applied in the formation of database search statements. Often called Boolean Logic, Boole's explanation of logical operators of thought provides the foundation of computer search engine syntax. Boolean "operators" are enlisted in search statements to help online searchers to restrict or expand their search results. Boolean Logic separates concepts from each other and examines their properties relative to each other. These properties can be demonstrated through **Venn diagrams** and **syllogistic statements** .

The pragmatics of Boolean Logic are found in AND, OR, and NOT statements. Unlike in typical mathematics, AND statements limit results. For example, 2 3 5. However, in Boolean Logic, the combination of Concept A and Concept B yields only results that contain *both* A and B. Thus, the resulting set number is less than either of the two concepts viewed singularly. This concept is often difficult for database searchers to learn to use. Accustomed to the numerical principle that adding units together yields greater results, the most common mistake of novice online searchers is to add too many variables to their search syntax, believing that more variables will provide more results. In fact, the opposite is true.

To get more results with a Boolean search, the OR statement is needed. OR statements can be tricky, however, depending on where they appear in the search statement. For example, A OR B AND C can be interpreted as (A OR B) AND C, which is likely what the searcher intends. If the search engine interprets the statement as A OR (B AND C), very different results are given. Properly placed parentheses are recommended in virtually all cases where the OR operator is employed.

The NOT operator is also a limiter, in that it restricts the search by omitting results that contain the NOT word or concept. For example, A AND B NOT C will retrieve records that contain A and B but exclude all records that contain C, even if they contain A and B.

As is evident from Boolean operators, relationships among objects or ideas may be governed by a logic that is not necessarily congruent with conventional human reasoning. What may be rational in numbers, e.g. addition, does not "add up" when applied to the use of the Boolean "AND" in a search statement.

Boole was drawn to explore the depths of logical and mathematical reasoning, and the ways in which human thought comprehends the relationships among ideas. In ways Boole could never have foreseen, his intellectual interests provided the foundation for future generations of logicians and mathematicians whose work is enhanced by the computing and database searching technology people take for granted today.

**see also** Boolean Algebra; Digital Logic Design.

*Tom* *Wall*

### Bibliography

Gasser, James, ed. *A Boole Anthology: Recent and Classical Studies in the Logic of George Boole.* Boston: Kluwer Academic Publishers, 2000.

MacHale, Desmond. *George Boole: His Life and Work.* Dublin: Boole Press, 1983.

#### Internet Resources

O'Connor, John J., and Edmund F. Robertson. "George Boole." Web site of the School of Mathematics and Statistics, University of St. Andrews, Scotland. <http://www-history.mcs.st-andrews.ac.uk/history/Mathematicians/Boole.html>

Voss, Natalie D. "George Boole." *Jones Telecommunications and Multimedia Encyclopedia.* <www.digitalcentury.com/encyclo/update/boole.html>

## Boole, George

# Boole, George

*British Mathematician 1815–1864*

**Digital logic** is the set of rules applied to data (numbers, symbols, words) that are entered into a computer. These instructions direct computers and are called **machine code** . This code uses the **binary** digits 1 and 0 to switch **transistors** on or off. The basic operators that perform these tasks are AND, OR, and NOT. A hundred years before electronic computers were conceived, George Boole proposed this binary or digital logic.

Born to working-class English parents, Boole later supported himself and his parents as a school instructor. Frustrated by the inferior mathematics texts used to educate pupils, Boole was led to change the world of numbers. With only a basic science background, Boole labored 5 years to learn mathematics, eventually publishing in the *Cambridge Mathematical Journal.* His reputation was heightened in 1847 when he published *The Mathematical Analysis of Logic,* which introduced Boole's ideas on the two-valued (presence "1" or absence "0") system of algebra that represented logical operations.

For centuries, philosophers have studied logic. However, George Boole argued that logic could be taught with mathematics rather than with philosophy. Boole envisioned mathematical symbols, rather than words, as the truest representation of logic.

Even though he had not studied at a university, Boole was appointed in 1849 as mathematics professor at Queens (University) College in Ireland. Eventually, Boole was appointed to the position of mathematics chairman at Queens, where he gained a reputation as an outstanding teacher.

In 1854, Boole published *An Investigation into the Laws of Thought,* in which he combined algebra with logic. This concept became known as **Boolean algebra** . Because George Boole demonstrated that logic could be reduced to very simple algebraic systems, it was possible for Charles Babbage and his successors to design mechanical devices that could perform the necessary logical tasks. Today, Boolean algebra is the logic that computers use to perform everything they do.

## Boolean Algebra

Boolean algebra is a branch of mathematics in which statements, ideas, numbers, and so forth are denoted by symbols (e.g., *x*, *y*, *z* ) and can be acted upon by operators (e.g., AND or OR). The operator AND between two symbols (*x* AND *y* ) is known as the union of *x* and *y* and refers to objects both in *x* and *y*. The operator OR represents the intersection of *x* and *y* (*x* OR *y* ) and consists of objects either in *x*, in *y*, or in both *x* and *y*.

As an example of applying Boolean algebra in computers, let *x* and *y* denote two electronic circuits that are either closed (electricity flows) or open (electricity does not flow). The statement *x* AND *y* is represented by connecting the switches in series. (See series diagram.) The current will flow only if both *x* and *y* are closed. Similarly, a circuit with switches connected in parallel is represented by the statement *x* OR *y*. (See parallel diagram.) The current will flow if either *x* is closed, *y* is closed, or both *x* and *y* are closed.

Internet search engines use Boolean algebra in the form of AND and OR. For instance, searching "African OR American" produces articles that contain either or both these words, a result that is broad in scope. Searching for "African AND American" produces articles that contain both words, a result that is more narrow in scope.

## Boole's Influence on Computers

Boole was a great mathematician, but he never forgot that mathematics came into existence to search for practical scientific solutions. Boolean algebra is the basis for subjects such as **information theory** , computer science, electrical-circuit theory, and artificial-intelligence research.

Seventy-three years after Boole's death, an MIT student recognized the connection between electronic circuits and Boolean algebra. The student transferred two logic states to electronic circuits by assigning different voltage levels to each state. This connection was the step necessary to take Boole's theory to the practical design of computers. As a result, Boole is considered one of the founding fathers of computers and information technology.

see also Babbage, Charles; Computers, Evolution of Electronic; Mathematical Devices, Early; Mathematical Devices, Mechanical.

*William Arthur Atkins* with

*Philip Edward Koth*

## Bibliography

Boole, George. *An Investigation of the Laws of Thought.* New York: Dover Publications, 1958.

Boyer, Carl B. *A History of Mathematics,* 2nd ed. New York: John Wiley and Sons, Inc., 1991.

Henderson, Harry. *Modern Mathematicians.* New York: Facts on File, 1996.

### Internet Resources

"George Boole." School of Mathematics and Statistics, University of St Andrews, Scotland. <http://www.history.mcs.st-and.ac.uk/history/Mathematicians/Boole.html>.

## George Boole

# George Boole

The English mathematician George Boole (1815-1864) invented mathematical, or symbolic, logic and uncovered the algebraic structure of deductive logic, thereby reducing it to a branch of mathematics.

George Boole was born on Nov. 2, 1815, in Lincoln. He attended a primary school of the National Society and then a school for commercial subjects. This was the last of his formal schooling but not the end of his education, for he inherited a talent for self-study from his father, a shoemaker by trade but a philosopher by inclination. At the age of 16 young Boole became an assistant teacher in an elementary school. Four years later he opened his own school.

Meanwhile he had discovered mathematics. Disgusted with the poor quality of the texts that his students had to use, Boole began to study the works of the great mathematicians. Without guidance he mastered these books and was producing original mathematics by 1840, barely 5 years after beginning serious study of the subject.

In 1844 Boole's pioneering paper on the calculus of operators won the Royal Society's gold medal and established his reputation among mathematicians. Three years later he published *The Mathematical Analysis of Logic,* the slim booklet that initiated modern symbolic logic. In it Boole showed how all the ponderous verbalism of Aristotelian logic could be rendered in a crisp algebra that was remarkably similar to the ordinary algebra of numbers. "We ought no longer to associate Logic and Metaphysics, but Logic and Mathematics."

In 1849 Boole finally lost his amateur status. He was appointed professor of mathematics at the new Queen's College in Cork, Ireland. His best-known work, *An Investigation of the Laws of Thought on Which Are Founded the Mathematical Theories of Logic and Probabilities* (1854), is
an elaboration of the 1847 booklet. In 1860 he published a text on the calculus of finite differences which remains the classic on that subject.

Boole married Mary Everest in 1855; she bore him five daughters. Their life together was serene but short, for Boole died on Dec. 8, 1864, of pneumonia. The citizens of Lincoln installed a stained-glass window in the Cathedral to his memory.

Boole's reputation continues to grow. In 1847 he pointed out that the value of his theories would depend largely upon the extent of their applications. Today, along with symbolic logic, Boolean algebra is of central importance in such diverse fields as probability, combinatorial theory, information theory, graph theory, switching theory, and computer design.

## Further Reading

The biographical essay on Boole in E. T. Bell, *Men of Mathematics* (1937), contains minor inaccuracies and a questionable character analysis but is otherwise an excellent review of Boole's place in the history of mathematics. For a good discussion of Boole's fundamental ideas see Herbert Meschkowski, *Ways of Thought of Great Mathematicians* (1964). For modern developments consult J. Eldon Whitesitt, *Boolean Algebra and Its Applications* (1961). A concise history of symbolic logic is in Clarence Irving Lewis and Cooper Harold Langford, *Symbolic Logic* (1932; 2d ed. 1959).

## Additional Sources

MacHale, Desmond, *George Boole: his life and work,* Dublin: Boole Press, 1985. □

## George Boole

# George Boole

**1815-1864**

**English Mathematician**

George Boole was an English mathematician who was among the founders of modern symbolic logic. His algebra of logic, which has come to be called *Boolean algebra*, is basic to the design of digital computers.

Boole was born on November 2, 1815, in Lincoln, England. His father was a tradesman, and taught him how to make optical instruments, as well as the rudiments of mathematics. A local bookseller taught him Latin. Aside from this early training and a few years at local schools. Boole was self-educated. He had to earn an income to help support his family, and by the age of 20 he was an experienced schoolteacher with his own school in Lincoln. In his limited free time, he studied mathematics, including such classic works as Isaac Newton's (1642-1727) *Principia*, Pierre Simon de Laplace's (1749-1827) *Traité de mécanique céleste*, and Joseph Louis Lagrange's (1736-1813) *Mecanique analytique*.

Beginning in 1839, Boole submitted a number of papers to the *Cambridge Mathematical Journal*. This new journal was edited by Duncan Gregory, who acted as Boole's mentor. In 1844, Boole published an important paper in the *Philosophical Transactions of the Royal Society*, on using algebraic methods to solve differential equations. The paper resulted in his being awarded the Society's Royal Medal.

Boole soon realized that algebra could be applied to logic as well. In 1847, he published a pamphlet entitled *Mathematical Analysis of Logic*, arguing that logic should be considered a branch of mathematics rather than a branch of philosophy. A more complete treatment of his symbolic logic was published in 1854 as *An Investigation into the Laws of Thought, on Which are Founded the Mathematical Theories of Logic and Probabilities*.

The key to Boole's system of symbolic logic, which came to be known as *Boolean algebra*, was the separation of the symbols of operation from those of quantity. The operational symbols, such as + , can be used to represent logical relationships and operations. Symbols expressing quantity are not used in Boolean logic because it is a two-valued system referring only to the presence or absence of some attribute. This is generally expressed as one and zero, on and off, or true and false.

Despite his lack of a university degree, Boole was appointed a professor of mathematics at Queen's College in Ireland in 1849 on the strength of his published work. Later he was elected a Fellow of the Royal Society. In 1855, he married Mary Everest, the niece of mountaineer George Everest. They had five daughters.

In addition to his work on symbolic logic, Boole wrote two influential books, the *Treatise on Differential Equations* (1859) and the *Treatise on the Calculus of Finite Differences* (1860). These were used as university texts for many years.

Boole remained at Queen's College for the rest of his life, and enjoyed a reputation as an excellent teacher. Unfortunately, his career started late and ended early, when he died at the age of 49, on December 8, 1864, of a feverish cold that progressed to pneumonia. However, his work is the foundation upon which the Information Age was built.

**SHERRI CHASIN CALVO**

## Boole, George

George Boole, 1815–64, English mathematician and logician. He became professor at Queen's College, Cork, in 1849. Boole wrote *An Investigation of the Laws of Thought* (1854) and works on calculus and differential equations. He developed a form of symbolic logic, called Boolean algebra, that is of fundamental importance in the study of the foundations of pure mathematics and is also at the basis of computer technology.

## Boole, George

**Boole, George** (1815–64) English mathematician. Largely self-taught, he was appointed (1849) professor of mathematics of Cork University. He is best-known for his invention of Boolean algebra, a set of symbols which can be manipulated to represent logical operations. It is mostly used in computers.