Boolean algebra

Also found in: Dictionary, Thesaurus, Medical, Wikipedia.

Boolean algebra

(bo͞o`lēən), an abstract mathematical system primarily used in computer science and in expressing the relationships between setsset,
in mathematics, collection of entities, called elements of the set, that may be real objects or conceptual entities. Set theory not only is involved in many areas of mathematics but has important applications in other fields as well, e.g.
..... Click the link for more information.
 (groups of objects or concepts). The notational system was developed by the English mathematician George BooleBoole, George,
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.
..... Click the link for more information.
 c.1850 to permit an algebraic manipulation of logical statements. Such manipulation can demonstrate whether or not a statement is true and show how a complicated statement can be rephrased in a simpler, more convenient form without changing its meaning. In his 1881 treatise, Symbolic Logic, the English logician and mathematician John Venn interpreted Boole's work and introduced a new method of diagramming Boole's notation; this was later refined by the English mathematician Charles Dodgson (better known as Lewis CarrollCarroll, Lewis,
pseud. of Charles Lutwidge Dodgson,
1832–98, English writer, mathematician, and amateur photographer, b. near Daresbury, Cheshire (now in Halton).
..... Click the link for more information.
—this method is now know as the Venn diagram. When used in set theory, Boolean notation can demonstrate the relationship between groups, indicating what is in each set alone, what is jointly contained in both, and what is contained in neither. Boolean algebra is of significance in the study of information theory, the theory of probability, and the geometry of sets. The expression of electrical networks in Boolean notation has aided the development of switching theory and the design of computers.

Boolean algebra

[′bü·lē·ən ′al·jə·brə]
An algebraic system with two binary operations and one unary operation important in representing a two-valued logic.

Boolean algebra

a system of symbolic logic devised by George Boole to codify logical operations. It is used in computers

Boolean algebra

(mathematics, logic)
(After the logician George Boole)

1. Commonly, and especially in computer science and digital electronics, this term is used to mean two-valued logic.

2. This is in stark contrast with the definition used by pure mathematicians who in the 1960s introduced "Boolean-valued models" into logic precisely because a "Boolean-valued model" is an interpretation of a theory that allows more than two possible truth values!

Strangely, a Boolean algebra (in the mathematical sense) is not strictly an algebra, but is in fact a lattice. A Boolean algebra is sometimes defined as a "complemented distributive lattice".

Boole's work which inspired the mathematical definition concerned algebras of sets, involving the operations of intersection, union and complement on sets. Such algebras obey the following identities where the operators ^, V, - and constants 1 and 0 can be thought of either as set intersection, union, complement, universal, empty; or as two-valued logic AND, OR, NOT, TRUE, FALSE; or any other conforming system.

a ^ b = b ^ a a V b = b V a (commutative laws) (a ^ b) ^ c = a ^ (b ^ c) (a V b) V c = a V (b V c) (associative laws) a ^ (b V c) = (a ^ b) V (a ^ c) a V (b ^ c) = (a V b) ^ (a V c) (distributive laws) a ^ a = a a V a = a (idempotence laws) --a = a -(a ^ b) = (-a) V (-b) -(a V b) = (-a) ^ (-b) (de Morgan's laws) a ^ -a = 0 a V -a = 1 a ^ 1 = a a V 0 = a a ^ 0 = 0 a V 1 = 1 -1 = 0 -0 = 1

There are several common alternative notations for the "-" or logical complement operator.

If a and b are elements of a Boolean algebra, we define a <= b to mean that a ^ b = a, or equivalently a V b = b. Thus, for example, if ^, V and - denote set intersection, union and complement then <= is the inclusive subset relation. The relation <= is a partial ordering, though it is not necessarily a linear ordering since some Boolean algebras contain incomparable values.

Note that these laws only refer explicitly to the two distinguished constants 1 and 0 (sometimes written as LaTeX \top and \bot), and in two-valued logic there are no others, but according to the more general mathematical definition, in some systems variables a, b and c may take on other values as well.
References in periodicals archive ?
One of his biographers explained Boolean algebra with a simple example: If the symbol x represents the class of all "white objects" and the symbol y the class of all "round objects," the symbol xy represents the class of objects that are simultaneously white and round.
k], +, *, 0, 1> becomes a semiring and is called a general Boolean algebra (see [13]).
This interval is isomorphic to the Boolean algebra [B.
True,False) is a Boolean algebra providing each function in B is idempotent and diagonal and any two such functions commute.
His topics include number systems, Boolean algebra and logic, integrated logic, combinational logic, and synchronous sequential logic.
2) Generalized Boolean algebra if (x [right arrow] y) [right arrow] x = x, for all x,y [member of] A.
An understanding of basic logic design and Boolean algebra is assumed.
Since EchoSearch incorporates natural language processing ability, rather than the Boolean algebra employed by other search and indexing tools, it allows for the development of "dictionaries" specific to individual industries.
It describes reversible computing from various points of view: Boolean algebra, group theory, logic circuits, low-power electronics, communication, software, quantum computing.
Written for students and researchers in the fields of behavioral sciences, history and logic, this textbook on comparative methods with Boolean algebra explains how these mathematical theories are used in a wide range of disciplines for basic scientific research.
They cover digital logic gates, Boolean algebra and logic gates, combinational logic gates, number systems, conversions, codes, binary addition and subtraction, digital timing and signals, sequential logic gates, counters and shift registers, data conversion, and advanced digital concepts.