Use basic logical equivalences to show that (r ∧ ¬(p → q)) ∨ (r ∧ ¬(p ∧ ¬q)) is logically equivalent to r. Show all your work and write the names of the logical equivalences you are using at each step.
Added by Juan Francisco A.
Step 1
(r ∧ ¬(p → q)) ∨ (r ∧ ¬(p ∧ ¬q)) Show more…
Show all steps
Close
Your feedback will help us improve your experience
Suman K and 97 other Calculus 3 educators are ready to help you.
Ask a new question
Labs
Want to see this concept in action?
Explore this concept interactively to see how it behaves as you change inputs.
Key Concepts
Recommended Videos
Prove the logical equivalence of (p v ~q) -> r = -r -> (7p ^ q) by the following approaches: Using a truth table (you can use the laws of propositional logic).
Adi S.
Use the logical equivalences to show that (¬q ∧ (p → q)) → ¬p is a tautology.
Sri K.
Each of Exercises $20-32$ asks you to show that two compound propositions are logically equivalent. To do this, either show that both sides are true, or that both sides are false, for exactly the same combinations of truth values of the propositional variables in these expressions (whichever is easier). Show that $\neg p \rightarrow(q \rightarrow r)$ and $q \rightarrow(p \vee r)$ are logically equivalent.
The Foundations: Logic and Proofs
Propositional Equivalences
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD