Boolean Algebra

Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called as Binary Algebra or logical Algebra. Boolean algebra was invented by George Boole in 1854.

Boolean Laws
There are six types of Boolean Laws.

Commutative law
Any binary operation which satisfies the following expression is referred to as commutative operation.

Commutative Law
Commutative law states that changing the sequence of the variables does not have any effect on the output of a logic circuit.

Associative law
This law states that the order in which the logic operations are performed is irrelevant as their effect is the same.

Associative Law
Distributive law
Distributive law states the following condition.

Distributive Law
AND law
These laws use the AND operation. Therefore they are called as AND laws.

AND Law
OR law
These laws use the OR operation. Therefore they are called as OR laws.

OR Law
INVERSION law
This law uses the NOT operation. The inversion law states that double inversion of a variable results in the original variable itself.