Discrete Mathematics and Its Applications, Seventh Edition

Published by McGraw-Hill Education
ISBN 10: 0073383090
ISBN 13: 978-0-07338-309-5

Chapter 12 - Section 12.1 - Boolean Functions - Exercises - Page 818: 33

Answer

Showing that you obtain De Morgan’s laws for propositions when you transform De Morgan’s laws for Boolean algebra in Table 6 into logical equivalences.

Work Step by Step

If we replace each 0 by F, 1 by T, Boolean sum by ∨, -Boolean product by ∧, and by ¬ (and x by p and y by q so that the variables look like they represent propositions, -and the equals sign by the logical equivalence symbol), - then xy = x + becomes ¬(p ∧ q) ≡ ¬p ∨ ¬q and x + y = x y becomes ¬(p ∨q) ≡ ¬p∧¬q.
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.