The axioms for Boolean algebra
(a) x+y=y+x + is commutative
(b) x.y=y.x . is commutative
(c) (x + y) + z = x + (y + z) + is associative
(d) (x . y) . z = x . (y . z) . is associative
(e) x + ( y . z ) = (x + y) . (x + z) + distributes over .
(f) x . (y + z) = (x . y) + (x . z) . distributes over +
(g) 0+x=x 0 is an identity for +
(h) 1.x=x 1 is an identity for .
(i) x + x' = 1 x' is a + complement of x
(j) x . x' = 0 x' is a . complement of x
(k) x+x=x idempotent law for +
(l) x.x=x idempotent law for .
(m) 0.x=0
(n) 1+x=1
(o) (x + y) ' = x' . y' de Morgan's law
(p) (x . y) ' = x' + y' de Morgan's law
(q) (x') ' = x double complement law
(r) x . (x + y) = x absorption law
(s) x + (x . y) = x absorption law
(t) (x . y) + (x . y') = x absorption law
(u) (x + y) . (x + y') = x absorption law
(v) x + x' . y = x + y
(w) x . (x' + y) = x . y
Duals
All Boolean expressions and equations has a dual, obtained by interchanging + and . , and
interchanging 0 and 1. For example, (k) and (l), (m) and (n), (o) and (p) are duals.
1. AND LAWS
i. A.0 = 0 (Null law)
ii. A.1 = A (Identity law)
iii. A.A = A (Idempotent law)
iv. A.A′=0 (Inverse law)
2. OR LAWS
i. A+0 = A (Null law)
ii. A+1 = 1 (Identity law)
iii. A+A = A (idempotent law)
iv. A+A′=1 (Inverse law)
3. DOUBLE COMPLEMENT LAWS (INVOLUTION LAW)
i. (A′)′=A
4. COMMUTATIVE LAWS
i. A.B = B.A
ii. A+B=B+A
5. ASSOCIATIVE LAWS
i. (A.B).C = A.(B.C)
ii. (A+B)+C = A+(B+C)
6. DISTRIBUTIVE LAWS
i. A.(B+C)=A.B+A.C
ii. A+BC=(A+B)(A+C)
7. DE MORGAN’S LAWS
i. (A.B)′=A′+B′
ii. (A+B)′=A′.B′
8. ABSORPTION LAWS
i. A+A.B=A
ii. A.(A+B)=A
9. REDUNDANT LITERAL LAWS
i. A+A′.B=A+B
ii. A.(A′+B)=AB
MINIMIZE THE FOLLOWING BOOLEAN EXPRESSION:
i. AB′C+B+BD′+ABD′+A′C=B+C
ii. A[B+C′(AB+AC′)′]=AB
iii. (A+(BC)′)′(AB′+ABC)=0