Scribd
Upload
10 views25 pages

Boolean Algebra6

Uploaded by

William Maurice C. Dulot
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
10 views25 pages

Boolean Algebra6

Uploaded by

William Maurice C. Dulot
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 25

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, (x’)’ = x
Involution
Postulate 3, (a) x + y = y + x (b) xy = yx
Commutative
Theorem 4, (a) x + (y + z) = (x + y) + z (b) x(yz) = (xy)z
Associative
Postulate 4, (a) x(y + z) = xy + xz (b) x + yz = (x + y)(x + z)
Distributive
Theorem 5, (a) (x + y)’ = x’y’ (b) (xy)’ = x’ + y’
DeMorgan
Theorem 6, (a) x + xy = x (b) x(x + y) = x
Absorption
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 y xy x + xy
0 0 0 0
0 1 0 0
1 0 0 1
1 1 1 1
De Morgan’s Theorem:
(x + y)’ = x’y’
x y x + y (x + y)’ x’ y’ x’y’
0 0 0 1 1 1 1
0 1 1 0 1 0 0
1 0 1 0 0 1 0
1 1 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
x y x y

xy’ x’y

xy x 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.
x y z F1 F2 F3 F4

Given: 0 0 0 0 0 0 0
0 0 1 0 1 1 1
F1 = xyz’ 0 1 0 0 0 0 0
F2 = x + y’z 0 1 1 0 0 1 1
F3 = x’y’z + x’yz + xy’ 1 0 0 0 1 1 1
1 0 1 0 1 1 1
F4 = xy’ + x’z
1 1 0 1 1 0 0
1 1 1 0 1 0 0
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 + x’y
2. x(x’ + y)
3. x’y’z + x’yz + xy’
4. xy + x’z + yz
5. Prove (x+y)(x’ + z)(y + z) = (x + y)(x’ + z)
6. Prove (A + B)(A + C) = A + BC
7. Prove A + A’B = A + B
8. Prove (A + B)(A + B’)(A’ + C) = AC
9. Prove ABC + AB’C + ABC’ = A(B + C)
Algebraic Manipulation
Simplify the following Boolean expression and show
minimum gate implementation.
1. y = ABC’ + ABC + AB’C’ + AB’C + A’BC
2. y = ABC’D’ + A’BC’D’ + BC’D
3. y = B’(A + C) + C(A’ + B) + AC
De Morgan’s Theorem
De Morgan’s 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.
Dual’s of a function is obtained by
interchanging AND and OR operators and 1’s
and 0’s.
F1 = x’yz’ + x’y’z
Dual of F1 = (x’ + y + z’)(x’ + y’ + z)
Complement each literal = (x + y’ + z)(x + y + z’) = F1’

F2 = x(y’z’ + 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’ + A’D)(AB’ + CD’)
b) B’D + A’BC’ + ACD + A’BC

You might also like