Boolean algebra

[ boo-lee-uhn ]

noun

1. Logic. a deductive logical system, usually applied to classes, in which, under the operations of intersection and symmetric difference, classes are treated as algebraic quantities.
2. Mathematics. a ring with a multiplicative identity in which every element is an idempotent.

Boolean algebra

/ ˈbuːlɪən /

noun

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

Boolean algebra

/ bo̅o̅′lē-ən /

1. A form of symbolic logic, in which variables, which stand for propositions, have only the values “true” (or “1”) and “false” (or “0”). Relationships between these values are expressed by the Boolean operators AND, OR, and NOT. For example, “a + b” means “a OR b”, and its value is true as long as either a is true or b is true (or both). Boolean logic can be used to solve logical problems, and provides the mathematical tools fundamental to the design of digital computers. It is named after the mathematician George Boole.
2. Also called Boolean logic
3. See also logic gate

Word History and Origins

Origin of Boolean algebra¹

1885–90; named after George Boole; -an

Example Sentences

Work with computers long enough and you are sure to hear the phrase “Boolean algebra,” which refers to the machine’s underlying logic.

From Salon

Engineers now routinely design computer hardware and software, telephone networks and other complex systems with the aid of Boolean algebra.

From Scientific American

Boolean algebra and Boolean logic are very well known today, and form the backbone of electrical engineering and computer science.

From Scientific American

Boole work, commonly referred to as Boolean algebra, went on to influence binary systems used in electrical circuits and computers.

From Time

The other was Alan Turing, who pointed out in the 1930s that, with Boolean algebra, only three logical functions are needed to process these “trues” and “falses”–or, in computer terms, 1s and 0s.

From Time