Boolean Algebra: Laws

There are a total of six types of laws in Boolean algebra:

1. Commutative Law

2. Associative Law

3. Distributive Law

4. AND Law

5. OR Law

6. Inversion Law

Commutative Law

The commutative law states that the output of the digital logic circuit remains unchanged even if the sequence of the variables is changed. 

Boolean expressions will satisfy the following:

1. A.B=B.A
2. A+B=B+A

Associative Law

The associative law states that the order in which the operations are performed is irrelevant. 

Therefore, it will satisfy the following expressions:

1. A.(B.C)=(A.B).C
2. (A+B)+C=A+(B+C)

Distributive Law

According to the distributive law, the following expression should be satisfied:

A.(B+C)=A.B+A.C

AND Law

AND Laws use the AND operations. They are mentioned below:

1. A.A=A
2. A,0=0
3. A.1=A
4. A.A(bar)=0

OR Law

OR law uses te=he OR operations. They are mentioned below:

1. A+0=A
2. A+A=A
3. A+1=1
4. A+A(bar)=1

Inversion Law

Inversion law uses the NOT operation, it states that double inversion of variable results to the original variable. 

Reference

Boolean Algebra: Laws