Laws (Theorems) of Boolean Algebra
Laws (Theorems) of Boolean Algebra
Laws of Complementation
o The term complement means, to invert or to change 1's to 0's and 0's to 1's, for which purpose inverters or NOT gates are used. o A complement of a variable is represented by a bar over the letter. For example, the complement of a variable A will be denoted by
A
Law 1: 0 = 1
Law 2: 1 = 0 Law 3: If A = 0, A 1
Law 4: If A = 1, A 0
Law 5: A A
AND Laws
Law 6: A.0=0 Law 7: A.1=A
OR Laws
Law 10: A +0 = A Law 11: A +1 = 1
Commutative Laws
This states that the order in which the variables are ORed and ANDed will make no difference in the output. Law14: A. B = B. A Law 15 : A + B = B + A
Associative Laws
This law states that the order in which the variables are grouped will not make any difference in the output. Law 16: A + (B + C) = (A + B) + C
Distributive Laws
These laws allow the factoring or multiplying out of expressions. Law 18: A .(B +C) = (A .B) + (A .C) Law 19: A + (B .C) = (A + B) (A + C)
De Morgan's Theorems
1. 2.
X Y X Y
X Y X Y
The complement of any Boolean expression is found by using these two rules.
X Y X Y