Lecture 002 : Boolean Algebra (Cont.)
T1 : Commutative Law
(a) A + B = B + A
(b) A.B = B A
T2 : Associate Law
(a) (A + B) + C = A + (B + C)
(b) (A.B).C = A.(B C)
T3 : Distributive Law
(a) A.(B + C) = A.B + A.C
(b) A + (B.C) = (A + B).(A + C)
T4 : Identity Law
(a) A + A = A
(b) A.A = A
T5 :
(a) 
(b)
T6 : Redundance Law
(a) A + A.B = A
(b) A.(A + B) = A
T7 :
(a) 0 + A = A
(b) 0. A = 0
T8 :
(a) 1 + A = 1
(b) 1. A = A
T9 :
(a) 
(b)
T10 :
(a) 
(b)
T11 : De Morgan's Theorem
(a) 
(b) 
Laws of Boolean Algebra:
Note that every law has two expressions, (a) and (b). This is known as duality. These are obtained by changing every AND(.) to OR(+), every OR(+) to AND(.) and all 1's to 0's and vice-versa.
It has become conventional to drop the . (AND symbol) i.e. A.B is written as AB.
It has become conventional to drop the . (AND symbol) i.e. A.B is written as AB.
(b) A.B = B A
(b) (A.B).C = A.(B C)
(b) A + (B.C) = (A + B).(A + C)
(b) A.A = A
(b)
(b) A.(A + B) = A
(b) 0. A = 0
(b) 1. A = A
(b)
(b)
Or, (A + B)'
= A' . B'
A plus B whole prime (A + B)' is equals to
A
prime A' dot . B prime B'
Or, (A . B)'
= A' + B'
A dot B whole prime (A . B)' is equals to
A
prime A' plus + B prime B'