离散数学 练习1.57.1.docVIP

Chapter 1.5: 1. a) The rule addition is used. b) The rule simplification is used. c) The rule modus ponens is used. d) The rule modus tollens is used. e) The rule hypothetical syllogism is used. 3. Let p be the proposition “Randy works hard”, q the proposition “Randy is a dull boy”, r the proposition “Randy will not pet the job”. Then the hypothesis become p, p→q, q→r. The conclusion is simply r. Step Reason 1. p Hypothesis 2. p→q Hypothesis 3. q Modus ponens using steps 1 and 2 4. q→r Hypothesis 5. r Modus ponens using steps 3 and 4 5. Universal instantiation is used firstly, and then is modus ponens. 9. b) Let D(x) denote “x is in this class”, and let C(x) denote “x enjoys whale watching”. Let P(x) denote “x cares about ocean pollution”. Step Reason 1. ?(x)(D(x)→C(x)) Premise 2. D(somebody)→C(somebody) Existential instantiation using step 1 3. ?(x)(C(x)→P(x)) Premise 4. C(somebody)→P(somebody) Universal instantiation using step 3 5. D(somebody)→P(somebody) Hypothetical syllogism using steps 2 and 4 6. ?x(D(x)→P(x)) Existential generalization using step 5 d) Let D(x) denote “x is in New Jersey”, C(x) denote “x lives within 50 miles of the ocean”, and let P(x) denote “x has never seen the ocean”. Step Reason 1. ?(x)(D(x)→C(x)) Premise 2. D(someone)→C(someone) Universal instantiation using step 3 3. ?(x)(D(x)∧P(x)) Premise 4. D(someone)∧P(someone) Existential instantiation using step2 5. D(someone) Simplification using step 4 6. C(someone) Modus ponens using step 5 and 2 7. P(someone) Simplification using step 4 8. C(someone)∧P(someone) Conjunction using step 6 and 7 9. ?x(C(x)∧P(x)) Existential generalization using step 8 10. a) Let D(x) denote “x is a student in this class”, C(x) denote “x owns a red convertible”, and let P(x) denote “x has potter at least one speeding ticket”. Step Reason 1. ?x(C(x)→P