# Boolean Algebra

Boolean algebra, as developed in 1854 by George Boole in his book An Investigation of the Laws of Thought, is a variant of ordinary elementary algebra differing in its values, operations, and laws. Instead of the usual algebra of numbers, Boolean algebra is the algebra of truth values 0 and 1, or equivalently of subsets of a given set. The operations are usually taken to be conjunction ∧, disjunction ∨, and negation ¬, with constants 0 and 1. And the laws are definable as those equations that hold for all values of their variables, for example x∨(yx) = x. Applications include mathematical logic, digital logic, computer programming, set theory, and statistics. According to Huntington the moniker "Boolean algebra" was first suggested by Sheffer in 1913.

Boole's algebra predated the modern developments in abstract algebra and mathematical logic; it is however seen as connected to the origins of both fields. In an abstract setting, Boolean algebra was perfected in the late 19th century by Jevons, Schröder, Huntington, and others until it reached the modern conception of an (abstract) mathematical structure. For example, the empirical observation that one can manipulate expressions in the algebra of sets by translating them into expressions in Boole's algebra is explained in modern terms by saying that the algebra of sets is a Boolean algebra (note the indefinite article). In fact, M. H. Stone proved in 1936 that every Boolean algebra is isomorphic to a field of sets.

In the 1930s, while studying switching circuits, Claude Shannon observed that one could also apply the rules of Boole's algebra in this setting, and he introduced switching algebra as a way to analyze and design circuits by algebraic means in terms of logic gates. Shannon already had at his disposal the abstract mathematical apparatus, thus he cast his switching algebra as the two-element Boolean algebra. In circuit engineering settings today, there is little need to consider other Boolean algebras, thus "switching algebra" and "Boolean algebra" are often used interchangeably. Efficient implementation of Boolean functions is a fundamental problem in the design of combinatorial logic circuits. Modern electronic design automation tools for VLSI circuits often rely on an efficient representation of Boolean functions known as (reduced ordered) binary decision diagrams (BDD) for logic synthesis and formal verification.

Logic sentences that can be expressed in classical propositional calculus have an equivalent expression in Boolean algebra. Thus, Boolean logic is sometimes used to denote propositional calculus performed in this way. Boolean algebra is not sufficient to capture logic formulas using quantifiers, like those from first order logic. Although the development of mathematical logic did not follow Boole's program, the connection between his algebra and logic was later put on firm ground in the setting of algebraic logic, which also studies the algebraic systems of many other logics. The problem of determining whether the variables of a given Boolean (propositional) formula can be assigned in such a way as to make the formula evaluate to true is called the Boolean satisfiability problem (SAT), and is of importance to theoretical computer science, being the first problem shown to be NP-complete. The closely related model of computation known as a Boolean circuit relates time complexity (of an algorithm) to circuit complexity.

Read more about Boolean Algebra:  Values, Laws, Boolean Algebras, Axiomatizing Boolean Algebra, Propositional Logic

### Other articles related to "boolean algebra, algebra, boolean, boolean algebras":

Converse Nonimplication - Boolean Algebra - Properties - Neutral and Absorbing Elements
... Converse Nonimplication is noncommutative Step Make use of Resulting in Definition Definition - expand Unit element - evaluate expression - regroup common factors - join of complements equals unity - evaluate expression Implication is the dual of Converse Nonimplication Step Make use of Resulting in Definition -.'s dual is + - Involution complement - De Morgan's laws applied once - Commutative law. ...
Boolean Algebras Canonically Defined - Other Definitions of Boolean Algebra
... We have already encountered several definitions of Boolean algebra, as a model of the equational theory of the two-element algebra, as a complemented ... Stone (1936) A Boolean algebra is the set of all clopen sets of a topological space ... disconnected compact Hausdorff space, or Stone space, that is, every Boolean algebra arises in this way, up to isomorphism ...
Boolean Algebra - Applications - Boolean Operations - Boolean Searches
... Search engine queries also employ Boolean logic ... For this application, each web page on the Internet may be considered to be an "element" of a "set" ...
Boolean Algebras Canonically Defined - Boolean Algebras of Boolean Operations
... The n-ary Boolean operations themselves constitute a power set algebra 2W, namely when W is taken to be the set of 2n valuations of the n inputs ... is a column of a truth table, the columns can be combined with Boolean operations of any arity to produce other columns present in the table ... That is, we can apply any Boolean operation of arity m to m Boolean operations of arity n to yield a Boolean operation of arity n, for any m and n ...
Cardinal Functions in Boolean Algebras
... Cardinal functions are often used in the study of Boolean algebras ... for example, the following functions Cellularity of a Boolean algebra is the supremum of the cardinalities of antichains in ... Length of a Boolean algebra is is a chain Depth of a Boolean algebra is is a well-ordered subset ...