Brief history of Boolean Algebra:

George Boole (November 1815-1864) was a largely sel-taught Englis mathematician, philosopher,
logician introduce Boolean Algebra on his first book The Mathematical analysis of Logic (1847) and
Investigation of the Laws of Thought (1854).
Boolean Properties/Rule of ANDed Form ORed Form
Boolean Algebra
Identity A=A
A’ = A’
Commutative AB=BA A+B = B+A
Associative A(BC)=B(AC)=C(AB) A+(B+C)=B+(A+C)=C+(A+B)
Idempotent – denoting an AA = A A+A = A
element of a set that is
unchanged in value when
multiply or otherwise operated
on by itself
Double Negation is rule in logic A’’ = A
that holds a value is equivalent
to its double negation
Complementary the value of 1 AA’ = 0 A + A’ = 1
Input is AND or OR to its
complements value
Law of Intersection the value of A1 = A
an input is AND to 1 the result A0 = 0
will be equal to its value or OR
to 0 the result is equal to 0
Distributive A(B+C) = AB + AC A+ (BC) = (A+B) (A+C)
Absorption – identity linking a A(A+B) = A A + (AB) = A
pair of binary operation
Common Identities – a rule A(A’+B) = AB A + (A’B) = A+ B
where A ANDed to its
 compliments and ORed to the
B input it gives a result A ORed
or ANDed B
De Morgan’s Theorem (AB)’= A’+B’ (A+B)’ = A’B’

Idempotent

A+A=A

AA = A

Proof : if A = 0 and =1 therefor AA = A

00= 0 A+A

11=1 0+0=0

1+1=1

Complementary Law

AA’ = 0 A+A’ = 1

A=0 A=1

AA’ A+A’

01 =0 1 + 1’ = 1

0=0 1+0=1

1=1

Law of Intersection

If A = 0 if A = 1

A1 = A A0 = 1

01 = 0 10 = 0

0=0 0=0

Union

A + 1 =1

Proof:

A=0

A+0=1
0+1=1

0+0=0

Absorption

A (A+B) = A A + (AB) =A

If A = 0 and B= 1

A ( A+B) = A A + (AB)

(0) + 01 = 0 0 + 01 =0
0+0 =0 0+0=0
0=0 0 =0

Common Identities

A ( A’ + B) = AB A + (A’B) = A + B

If A = 0 and B=1

A ( A’+B ) = AB 0 + ( 0’ 1 ) = 0 + 1

0(0’ + 1 ) = 01 0 + ( 1 1) = 0 + 1

0 ( 1 + 1) = 01 0 + 1 = 0+1

01= 01

De Morgan Theorems

( AB)’ = A ‘ + B’ (A+B)’ = A’ B’

If A = 0 and B=1

(AB)’ = A ‘ + B’ ( 0 + 1 ) ‘ = 0’ 1’

(01)= 0’ + 1’ (1)’ = 10

0’ + 1’ = 1 +0 0=0

1=1

Simplification of Boolean Expression:

X = AB + AB’

= A ( B + B’ ) distributive since ( B+ B’) = 1

=A1 law of intersection A1 = 1

=A
2. X = AB + ABC + C’

X = AB( 1 + C ) + C’ distributive law

X = AB (1) + C’

X = AB + C’

3. X = AB’C + AB’C’ + AB’

X = AB’( C + C’ ) + AB’ DISTRIBUTIVE

X = AB’( 1 ) + AB’ COMPLEMENTARY since C + C ‘ = 1

X = B’ ( A1 + A ) DISTRIBUTIVE

X = B’ ( A + A ) LAW OF INTERSECTION

X = AB’

4. X = A’BC + AB’ + A’C

X = A’BC + A + C COMMON IDENTITIES A + A’ C = A + C

X = A’BC + C + A ASSOCIATIVE LAW

X = C ( A’B + 1 ) + A DISTRIBUTIVE LAW

X=C1+A UNION SINCE A’B+1 = 1

X = C1 + A LAW OF INTERSECTION since C1 = C

X=C+A COMMUTATIVE LAW since C + A = A + C

X=A+C