Discrete Mathematics and Its Applications, Seventh Edition

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

Chapter 1 - Section 1.3 - Propositional Equivalences - Exercises - Page 35: 42

Answer

The problem statement itself outlines the solution. Each row in the truth table represents a unique set of truth values for the n atomic propositions involved. For each such combination, we can construct a conjunction that is true specifically for that case. This conjunction is formed by combining all the atomic propositions that are true and the negations of all the atomic propositions that are false. By doing this for every row in the truth table where the compound proposition is intended to be true, and then taking the disjunction of these resulting propositions, we obtain the desired proposition in its disjunctive normal form.

Work Step by Step

Truth table: A B C F 0 0 0 1 0 0 1 0 0 1 0 1 0 1 1 1 1 0 0 0 1 0 1 1 1 1 0 1 1 1 1 1
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.