## boolean logic

- Boolean logic is defined as the use of words and phrases such as "and," "or" and "not" in search tools to get the most related results.
An example of Boolean logic is the use of "recipes AND potatoes" to find recipes that contain potatoes.

## boolean logic

(*uncountable*)

- (mathematics, logic, computing) A system of symbolic logic that is the basis of Boolean algebra
- Boolean logic can be shown to be "embedded" in integer arithmetic (modulo 2) by assigning polynomials to logical connectives, like so:

## boolean logic - Computer Definition

A branch of algebra in which all operations are either true or false, i.e., yes or no, and all relationships between the operations can be expressed with logical operators such as AND, OR, or NOT. Invented by English mathematician George Boole (1815

The "mathematics of logic," developed by English mathematician George Boole in the mid-19th century. Its rules govern logical functions (true/false) and are the foundation of all electronic circuits in the computer. As add, subtract, multiply and divide are the primary operations of arithmetic, AND, OR and NOT are the primary operations of Boolean logic. Boolean logic is turned into logic gates on the chip, and the logic gates make up logic circuits that perform functions such as how to add two numbers together. Various permutations of AND, OR and NOT are used, including NAND, NOR, XOR and XNOR. The rules, or truth tables, for AND, OR and NOT follow. See Boolean search, binary, logic gate and Bebop to the Boolean Boogie.