0% found this document useful (0 votes)
252 views10 pages

DeMorgan's Theorems and Truth Tables

1) The document describes DeMorgan's theorems, which are rules for simplifying Boolean expressions. 2) DeMorgan's Theorem #1 states that the negation of a conjunction is the disjunction of the negations. DeMorgan's Theorem #2 states that the negation of a disjunction is the conjunction of the negations. 3) Examples are provided to demonstrate how to use DeMorgan's theorems to simplify Boolean expressions into sum of products form.

Uploaded by

Shafiqul Shakil
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
0% found this document useful (0 votes)
252 views10 pages

DeMorgan's Theorems and Truth Tables

1) The document describes DeMorgan's theorems, which are rules for simplifying Boolean expressions. 2) DeMorgan's Theorem #1 states that the negation of a conjunction is the disjunction of the negations. DeMorgan's Theorem #2 states that the negation of a disjunction is the conjunction of the negations. 3) Examples are provided to demonstrate how to use DeMorgan's theorems to simplify Boolean expressions into sum of products form.

Uploaded by

Shafiqul Shakil
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

DeMorgan’s Theorems

Handout

Dr. Pang
DeMorgan’s
DeMorgan s Theorems
DeMorgan’s Theorems are two additional
simplification techniques that can be used to
simplify Boolean expressions. Again, the simpler
the Boolean expression
expression, the simpler the resulting
logic.

A  B  A B

A B  A  B
2
DeMorgan’s
DeMorgan s Theorem #1
A B  A  B
Proof
A B A B
A
A B A
A
A B B A B
B
B

A B A B A B A B A B A B
0 0 0 1 0 0 1 1 1
0 1 0 1 0 1 1 0 1
1 0 0 1 1 0 0 1 1
1 1 1 0 1 1 0 0 0
The truth-tables are equal; therefore, 3
the Boolean equations must be equal.
DeMorgan’s
DeMorgan s Theorem #2
A  B  A B
Proof
A B A B
A
A
A B
A
A B B A B
B B

A B A B A B A B A B A B
0 0 0 1 0 0 1 1 1
0 1 1 0 0 1 1 0 0
1 0 1 0 1 0 0 1 0
1 1 1 0 1 1 0 0 0
The truth-tables are equal; therefore, 4
the Boolean equations must be equal.
Summary
Boolean & DeMorgan’s Theorems
1) X 0  0 10A) X Y  Y  X
Commutative
2) X 1 X 10B) XYY X Law

3) XX X 11A) XYZ   XY Z


Associative
4) XX0 11B) X  Y  Z    X  Y   Z Law

5) X0 X 12A) XY  Z   XY  XZ


Distributive
6) X  1 1 12B) X  Y W  Z   XW  XZ  YW  YZ Law

7) XXX 13A) X  XY  X  Y
8) X  X 1 13B) X  XY  X  Y
Consensus
9) XX 13C) X  XY  X  Y Theorem

13D) X  XY  X  Y
14A) XYXY
DeMorgan’s
14B) XYX Y 5
DeMorgan Shortcut
BREAK THE LINE, CHANGE THE SIGN
Break the LINE over the two variables,
and change the SIGN directly under the line.

A B  A  B For Theorem #14A, break the line, and


change the AND function to an OR function.
Be sure to keep the lines over the variables.

A  B  A B For Theorem #14B, break the line, and


change the OR function to an AND function.
Be sure to keep the lines over the variables.

6
DeMorgan’s:
DeMorgan s: Example #1
Example
Simplify the following Boolean expression and note
the Boolean or DeMorgan’s theorem used at each
step. Put the answer in SOP form.

F1  ( X  Y )  ( Y  Z )

7
DeMorgan’s:
DeMorgan s: Example #1
Example
Simplify the following Boolean expression and note the
Boolean or DeMorgan’s theorem used at each step. Put
the answer in SOP form.
F1  ( X  Y )  ( Y  Z )
Solution
F1  ( X  Y )  ( Y  Z )

F1  ( X  Y )  ( Y  Z ) ; Theorem #14A

F1  ( X  Y )  ( Y  Z ) ; Theorem #9 & #14B

F1  ( X  Y )  ( Y  Z ) ; Theorem #9

F1  X Y  Y Z ; Rewritten without AND symbols 8


and parentheses
DeMorgan’s:
DeMorgan s: Example #2
So, where would such an odd Boolean expression come from?
Take a look at the VERY ppoorlyy designed
g logic
g circuit shown
below. If you were to analyze this circuit to determine the output
function F2, you would obtain the results shown.

X XY XY
( X  Z )( XY )
Y F2  ( X  Z )( XY )
X
Z XZ

Example
Simplify the output function F2. Be sure to note the Boolean or
DeMorgan’s theorem used at each step. Put the answer in
SOP form.
9
DeMorgan’s:
DeMorgan s: Example #2
Solution

F 2  ( X  Z )( XY )

F 2  ( X  Z )  ( XY ) ; Theorem
Th #14A

F 2  ( X  Z )  ( XY ) ; Theorem #9

F 2  ( X Z )  ( XY ) ; Theorem #14B

F 2  ( X Z )  ( XY ) ; Theorem #9

F2  X Z  X Y ; Rewritten without AND symbols

10

You might also like