Mark P.

Melegrito, PECE

Objective
Identify and apply the

different theorems and

properties of Boolean
Algebra in simplifying
boolean expressions.

Boolean Algebra
Named after its pioneer George Boole (1815

1864), is the algebra of logic presently applied to the

operation of computer devices.
Basic Theorems & Properties of Boolean Algebra
1. Postulates (Axioms) are statement of facts that

requires no proof.
2. Theorems is a statement which has been proven
on the basis of previously established statements.
Theorems must be proven from the postulates.
3. Laws established principles thought to be
universal and invariable facts. Laws may be disproved
if new facts or evidence contradicts them.

Postulates & Theorems of Boolean Algebra

Postulate 2

(a) x+ 0 = x

Postulate 5

(a) x + x = 1

Theorem 1

(a) x + x = x

Theorem 2

(a) x + 1 = 1

Theorem 3,
Involution

(x) = x

Postulate 3,
Commutative

(a) x + y = y + x

(b) xy = yx

Theorem 4,
Associative

(a) x + (y + z) = (x + y) + z

(b) x(yz) = (xy)z

Postulate 4,
Distributive

(a) x(y + z) = xy + xz

(b) x + yz = (x + y)(x + z)

Theorem 5,
DeMorgan

(a) (x + y) = xy

(b) (xy) = x + y

Theorem 6,
Absorption

(a) x + xy = x

(b) x(x + y) = x

Theorem 1(a): x + x = x

Theorem 3: (x) = x
x=0 x=1
x = 1 x = 0
x = 0 x = 1

Theorems of Boolean
Algebra can be hold true by
means of truth tables.
x
0
0
1
1

y
0
1
0
1

xy
0
0
0
1

x + xy
0
0
1
1

De Morgans Theorem:
(x + y) = xy
x
0
0
1
1

y
0
1
0
1

x + y (x + y) x y xy
0
1
1 1 1
1
0
1 0 0
1
0
0 1 0
1
0
0 0 0

Venn Diagram- a helpful illustration that

maybe used to visualize the relationship
among the variables in a Boolean expression.
Show: x = xy + x

y
xy

xy

xy

xy

As a whole; x = x + xy

Venn Diagram
Show : x(y + z) = xy + xz

Boolean Functions- is an expression formed

with binary variables, the two binary
operators OR & AND, the unary operator
NOT, parentheses and equal signs. For a
given value of the variables the functions can
either be 0 or 1.
Given:
F1 = xyz
F2 = x + yz
F3 = xyz + xyz + xy
F4 = xy + xz

F1

F2

F3

F4

Implementation
with Gates

Algebraic Manipulation
Literal is a primed or unprimed variable.
Simplify the following Boolean Functions to a minimum
number of literals.
1. x + xy
2. x(x + y)
3. xyz + xyz + xy
4. xy + xz + yz
5. Prove (x+y)(x + z)(y + z) = (x + y)(x + z)
6. Prove (A + B)(A + C) = A + BC
7. Prove A + AB = A + B
8. Prove (A + B)(A + B)(A + C) = AC
9. Prove ABC + ABC + ABC = A(B + C)

Algebraic Manipulation
Simplify the following Boolean expression and show
minimum gate implementation.
1. y = ABC + ABC + ABC + ABC + ABC
2. y = ABCD + ABCD + BCD
3. y = B(A + C) + C(A + B) + AC

De Morgans Theorem

De Morgans Theorem

Complement of a Function

Find the complement of the function F1 and

F2 of the previous example by taking their
duals and complementing each literal.
Duals of a function is obtained by
interchanging AND and OR operators and 1s
and 0s.
F1 = xyz + xyz
Dual of F1 = (x + y + z)(x + y + z)
Complement each literal = (x + y + z)(x + y + z) = F1

F2 = x(yz + yz)
Dual of F2 = x + (y + z)(y + z)
Complement each literal = x + (y + z)(y + z) = F2

Complement of a Function

Prepare for
QUIZ #2 by next
meeting!

Activity #6
1. Reduce the following Boolean expression to the

required number of literals.

a) BC + AC + AB + BCD ----- to four literals
b) [(CD) + A] + A + CD + AB ------ to three literals

2. Find the complement of the following Boolean

functions and reduce them to a minimum number of
literals.
a) (BC + AD)(AB + CD)
b) BD + ABC + ACD + ABC