This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ¬ q] ⇒ ¬ p 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 The rest of the rules of implication are listed on page 79 of the book. You will get more practice using these in recitation. Practice Problem : Using the rules of inference, and given the following premises: p ⇒ (q ⇒ r) p ∨ s t ⇒ q ¬ s Show that ¬ r ⇒ ¬ t must be true. Here is a list of the other rules stated in the text, without proof: p qp ∧ q (Rule of Conjuction) p ∨ q ¬ pq (Rule of Disjunctive Syllogism) ¬ p → Fp (Rule of Contradiction) p ∧ qp (Rule of Conjunctive Simplification) pp ∨ q (Rule of Disjunctive Amplification) p ∧ q p → (q → r)r (Rule of Conditional Proof) p → r q → r(p ∨ q) → r (Rule for Proof by Cases) p → q r → s p ∨ rq ∨ s (Rule of the Constructive Dilemma) p → q r → s ¬ q ∨ ¬ s¬ p ∨ ¬ r...
View
Full Document
 Spring '09
 Logic, Rule of Disjunctive Amplification

Click to edit the document details