# Boolean Algebra

## Definition - What does Boolean Algebra mean?

Boolean algebra is a type of mathematical operation that, unlike regular algebra, works with binary digits (bits): 0 and 1. While 1 represents true, 0 represents false. Computers can perform simple to extremely complex operations with the use of Boolean algebra. Boolean algebra and Boolean operations are the basis for computer logic.

## Techopedia explains Boolean Algebra

Unlike conventional mathematical operations – addition, subtraction, division and multiplication – the operations in Boolean algebra are different and limited in number. There are three operations: NOT, AND and OR. The NOT operation returns the opposite of the value that is provided to it. For example, 1 is the opposite of 0 and vice versa. So there are just two outcomes of the operation. Both the AND and OR operations take two digits and return 0 or 1 depending on the inputs. The AND operation returns 1 in case both the inputs are equal to 1. Else, it returns 0. The OR operation returns 1 only if either of the values given to it is 1. Else, it returns a value of 0.

Boolean algebra is named for George Boole, a mathematician who first described it in 1847.

#### Email Newsletter

Join thousands of others with our weekly newsletter

**Resources**

The 4th Era of IT Infrastructure: Superconverged Systems:

Approaches and Benefits of Network Virtualization:

Free E-Book: Public Cloud Guide:

Free Tool: Virtual Health Monitor:

Free 30 Day Trial – Turbonomic: