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.8 - Proof Methods and Strategy - Supplementary Exercises - Page 112: 2

Answer

Truth Table

Work Step by Step

As we know Conjunction $p \wedge q$ is true if both (sub) propositions ($p$ and $q$) are true. A disjunction $p \vee q$ is true, if either of (sub) propositions ($p$ and $q$) are true. A negation $P$ is true if the (sub)populations $P$ is false. A conditional statement $p \rightarrow q$ is true if $P$ is false or if both (sub) propositions are true. A biconditional statement $p \leftrightarrow q$ is true if both (sub) propositions are true or if both (sub) propositions are false. The truth table build with the help of this is given below
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.