9. Prove valid 1. (y) ((~Ty & By) \(Ty \supset ~Qy)) 2. (Ex) ((Kx \/ Sx) \/ (Sx \/ Bx)) 3. ~(z) Sz 4. (v) (Sv \/ (Tv \supset ~Kv)) \/(Ex) (Qx \supset (~Tx & Ax)) • 1. Cv (~Dv~X) /~D Premise 2. C Premise 3. X Premise 4. ~Dv~X 1,2 DS 5. ~D 3,4 DS 1. A \supset B /~C Premise 2. ~B Premise 3. ~A \supset (~CvB) Premise 4. ~A 1,2 MT 5. ~CvB 3,4 MP 6. ~C 2,5 DS 1. A \supset D /~~~A Premise 2. ~Dv (~B \supset ~~~A) Premise 3. ~A Premise 4. ~B Premise 5. D 1,3 MP 6. (~B \supset ~~~A) 2,5 DS 7. ~~~A 4,6 MP
Added by Denise W.
Close
Step 1
Is it due to limitations, constraints, or other factors? Show more…
Show all steps
Your feedback will help us improve your experience
Sri K and 89 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
Please write a natural deduction proof for the following deductive, valid argument. Be sure to construct the natural deduction proof in the way indicated in the Hurley textbook, the videos, and lecture material. Please use the typewriter SL symbols; number each derived line with the appropriate Arabic numeral; provide a correct justification on the right-hand side of the proof using the standard abbreviations for the Rules of Inference/Implication and Rules of Equivalence/Replacement including the lines number to which the rule was applied (do not apply more than one rule per line!!); one may use any of the eighteen (18) Rules of Inference/Implication and Rules of Equivalence/Replacement. The following argument has two (2) premises; please commence one's derivations on line 3. 1. ~ [ ( ~ P v ~ Q ) v ( R v ~ S ) ] 2. P > ( R v L ) / L
Sri K.
Problem 1 Given the following premises, use resolution and universal instantiation to prove F(c) where c is part of the domain of x and w. 1. ∀x A(x) 2. ∀x [¬A(x) ∨ C(x)] 3. ∀x,w [¬C(x) ∨ F(w)] Problem 2 Let the domain of the variables x, y, and w be the set {a,b,c}. Given the following premises, use resolution, universal generalization (Table 2 in section 1.6.7), and universal instantiation to prove ∀x B(x). 1. ¬A(x) ∨ B(y) 2. ¬C(x) ∨ G(w) 3. ¬G(x) 4. A(x) Problem 3 Repeat problem 2, but prove ∀w ¬C(w) TABLE 2 Rules of Inference for Quantified Statements
Akash M.
Recommended Textbooks
Calculus: Early Transcendentals
Thomas Calculus
Transcript
Watch the video solution with this free unlock.
EMAIL
PASSWORD