Tutorials

# Boolean Algebra Laws

The boolean postulates that we are going to learn in this chapter serves as the basic axioms of the algebraic structure.

The postulates don't need any proof and are used to prove the theorems of boolean algebra.

### Postulate 1

1. X = 0, if and only if, X is not equal to 1
2. X = 1, if and only if, X is not equal to 0

### Postulate 2

1. a + 0 = a
2. a.1 = a

The above postulate is referred as identity law of boolean algebra.

Postulate 3

1. a + b = b + a
2. a.b = b.a

The above postulate is referred as commutative law of boolean algebra.

Postulate 4

1. a + (b + c) = (a + b) + c
2. a.(b.c) = (a.b).c

The above postulate is referred as associative law of boolean algebra.

### Postulate 5

1. a. (b + c) = a.b + a.c
2. a + (b.c) = (a+b) . (a+c)

The above postulate is referred as distributive law of boolean algebra.

Postulate 6

1. a + a'  = 1
2. a . a' = 0

The above postulate is referred as complement law of boolean algebra.

These postulates are the core of the boolean algebra.