Boolean algebra is a branch of algebra concerned with variables whose values are truth values, true and false, usually denoted with the integers 0 and 1 respectively. The set of these truth values is known as a boolean domain. The Boolean domain acts the same way as the two-element set Integer Modulo 2. Boolean algebra is named after George Boole.
They can also be defined using a table called a truth table:
The operations on the boolean domain are known as boolean-valued operations. These include conjunction, disjunction, and negation. Here are more:
|Associativity of disjunction|
|Associativity of conjunction||
|Commutativity of disjunction|
|Commutativity of conjunction|
|Distributivity of conjunction over disjunction|
|Identity for disjunction|
|Identity for conjunction|
|Annihilator for disjunction|
|Annihilator for conjunction|
|Idempotence of disjunction|
|Idempotence of conjunction|
|Distributivity of disjunction over conjunction|
Boolean algebra is often used to define the semantics of several formal systems, such as classical propositional logic . Many concepts of syntax in those formal systems come from Boolean logic. These logic systems are referred to as Boolean logic.
Boolean logic is often used for logic gates in computers.