Try It Now

Site: Saylor Academy
Course: CS202: Discrete Structures
Book: Try It Now
Printed by: Guest user
Date: Sunday, May 5, 2024, 7:29 PM

Description

Work these exercises to see how well you understand this material.

Table of contents

Exercises

  1. Given the following propositions generated by p, q, and r, which are equivalent to one another?
    1. (pr) ∨ q
    2. p ∨ (rq)
    3. rp
    4. ¬rp
    5. (pq) ∧ (rq)
    6. rp
    7. r ∨ ¬p
    8. pr

  2. Is an implication equivalent to its converse? Verify your answer using a truth table.

  3. How large is the largest set of propositions generated by p and with the property that no two elements are equivalent?

  4. Explain why a contradiction implies any proposition and any proposition implies a tautology.



Source: Al Doerr and Ken Levasseur, http://faculty.uml.edu/klevasseur/ads-latex/ads.pdf
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 3.0 License.

Solutions

  1. Answer: ae, df, g ⇔ h

  2. Solution: No. In symbolic form, the question is: Is (p → q) ⇔  (q → p)?



    This table indicates that an implication is not always equivalent to its converse.

  3. Solution: Let x be any proposition generated by p and q. The truth table for x has 4 rows and there are 2 choices for a truth value for x for each row, so there are 2 · 2 · 2 · 2 = 24  possible propositions.

  4. Answer: 0 → p and p → 1 are tautologies.