Problem 1. [35 Points] Use logical reasoning to prove the following statements. Note that you can only use the rules in Table 3.2.1 in chapter 3 in the book, DeMorgan's law, contrapositive rule that has this format: A$\rightarrow$B $\neg$B$\rightarrow$$\neg$A and a new rule that's called Conditional Simplification that has this format: A$\rightarrow$B$\land$C $\therefore$ A$\rightarrow$B (Note that both rules can be proved by laws of propositional logic.) a) [15 Points] p$\rightarrow$(q$\land$r) s$\rightarrow$r r$\rightarrow$p $\therefore$ s$\rightarrow$q b) [20 Points] $\neg$r$\rightarrow$$\neg$s p$\rightarrow$u $\neg$t$\rightarrow$$\neg$r u$\rightarrow$s t$\rightarrow$q $\therefore$ p$\rightarrow$q
Added by Thomas K.
Close
Step 1
We are given the following statements: Show more…
Show all steps
Your feedback will help us improve your experience
Frank Deng and 76 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
Problem 6) (2 points): Use the rules of inference (together with basic logical equivalences if needed) to show that the following argument is valid. Name the rule you use at each step.
Adi S.
Statements Reasons 1. q ^ r given 2. ¬(¬p ^ q) given 3. ¬¬p ∨ ¬q 4. p ∨ ¬q 5. ¬q ∨ p 6. q → p 7. q 8. p
Shaiju T.
Assignment 1.1 Q1 Prove by truth table De Morgan's laws of logical equivalence. Q2 Prove by truth table Absorption laws of logical equivalence. Q3 Use logical equivalences to reduce the statement and find if the equivalency is true or false? ~((~p ∧ q) ∨ (~p ∧ ~q)) ∨ (p ∧ q) ≡ p Q4 Use logical equivalences to reduce the below expression involving conditionals: (p → (q → r)) ↔ ((p ∧ q) → r)
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
18,000,000+
Students on Numerade
Trusted by students at 8,000+ universities
Watch the video solution with this free unlock.
EMAIL
PASSWORD