This preview shows pages 1–4. Sign up to view the full content.
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: SECTION 1.5 Rules of Inference 2. This is modus tollens. The ﬁrst statement is p A q, where p is “George does not have eight legs” and q is
“George is not an insect.” The second statement is mq. The third is op. Modus tollens is valid. We can
therefore conclude that the conclusion of the argument (third statement) is true, given that the hypotheses
(the ﬁrst two statements) are true. . a) \Ve have taken the conjunction of two propositions and asserted one of them. This is, according to Table l, simpliﬁcation.
b) We have taken the disjunction of two propositions and the negation of one of them, and asserted the other.
This is, according to Table 1, disjunctive syllogism. See Table 1 for the other parts of this exercise as well. d) addition c) modus ponens e) hypothetical syllogism . Let ’r be the proposition “It rains,” let I be the proposition “It is foggy,” let S be the proposition “The sailing race will be held,” let i be the proposition “The life saving demonstration will go on," and let t be the
proposition “The trophy will be awarded.” We are given premises (n' V v_f) A (s A l), s —> t, and ﬁt. We
want to conclude r. We set up the proof in two columns, with reasons, as in Example 6. Note that it is valid
to replace subexpressions by other expressions logically equivalent to them. Step Reason 1. Hi Hypothesis 2. s —> t Hypothesis 3. 's Modus tollens using (1) and (2)
4. (er V of) —> (s A I) Hypothesis 5. (:(s A i')) a ﬁ(—ur V —~f) Contrapositive of (4) 6. (as V ﬁt) —) (r A f) De Morgan’s law and double negative
7. us V a! Addition, using (3) 8. rA f Modus ponens using (6) and (7) 9. 7' Simpliﬁcation using (8) First we use universal instantiation to conclude from “For all 1:, if a". is a man, then so is not an island”
the special case of interest, “If Manhattan is a. man, then Manhattan is not an island.” Then we form the
contrapositive (using also double negative): “11' Manhattan is an island, then Manhattan is not a man.” Finall)r we use modus ponens to conclude that iVIanhattan is not a man. Alternatively, we could apply modus tollens. Section 1.5 Rules of Inference 23 10. a) If we use modus tollens starting from the back, then we conclude that. I am not sore. Another application 12. of modus tollens then tells us that. I did not play hockey. b) We really can’t conclude anything speciﬁc here. c) By universal instantiation, we conclude from the first conditional statement by inodus ponens that dragon—
flies have six legs, and we conclude by modus tollens that spiders are. not insects. We could say using existential
generalization that, for example, there exists a nonssix—legged creature that eats a sixlegged creature, and
that there exists a non—insect that eats an insect. d) W? can apply universal instantiation to the conditional statement and conclude that if Homer (respectively,
l\‘Iaggie) is a student, then he (she) has an Internet account. New modus tollens tells us that Homer is not a
student. There are no conclusions to be drawn about l\*Iaggie. e) The ﬁrst conditional staten'ient is that if a: is healthy to eat, then :1: does not taste good. Universal
instantiation and modus ponens therefore tell us that tofu does not taste good. The third sentence says that
if you eat 1', then a; tastes good. Therefore the fourth hypothesis already follows (by modus tollens) from the
ﬁrst. three. N0 conclusions can be drawn about cheeseburgers from these statements. f) By disjunctive syllogism, the ﬁrst two hypotheses allow us to conclude that I am halhicinating. Therefore
by mod us ponens We know that I see elephants running down the road. Applying Exercise II, we want to show that the conclusion r follows from the five premises ([1 A l) 4i (r V s),
q —> (u. A t), u ——> p, as, and q. From q and q —» (u A t) We get 11. At by modus ponens. From there we get
both a and t by simplification (and the commutative law). From a and u. a p we get ,0 by modus ponens.
From 1) and t we get 19 At. by conjunction. From that and (p A f.) —) (r V s) we get r V s by modus ponens.
From that and as we ﬁnally get 7' by disjunctive syllogism. . In each case we set up the proof in two columns, with reasons, as in Example 6. a) Let c(;::) be “:5 is in this class,” let r(:1:) be “1: owns a red convertible,” and let. t(;c) be “:7: has gotten
a speeding ticket." We are given premises C(Linda), r(Linda), Va:(r(:i:) —> t(rr)), and we want to conclude
El;r(c(:c) A t(:c)). Step .1. Va:(r(:i:) —> 2. 'r‘(Linda) —> t(Linda) 3. r(Linda) 4. {(Linda) 5. C(Linda) l3. C(Linda) /\ t(Linda) 7. /\ b) Let be “r‘ is one of the five roommates listed,” let d(;c) be “is has taken a course in discrete Reason Hypothesis Universal instantiation using (1)
Hypothesis Modus ponens using and (3)
Hypothesis Conjunction using (4) and Existential generalization using (6) mathematics,” and let (1(a) be “'3: can take a course in algorithms.” We are given premises Va;(=r(.r) a cl(:i;))
and V;r:(d(.r) a (1(a)), and we want to conclude Vrr(r(:c) —) In what follows y represents an arbitrary person.
Step Reason
1. V:c(r($) —’ (1(1)) Hypothesis
2. —) all!) Universal instantiation using (I)
3. VJ:(d(.1:) ——> e.(a:)) Hypothesis
4. d(y) a (1(1)) Universal instantiation using 5. 7'(y) —> a(y) Hypothetical syllogism using (2) and (4)
6. Vsc(r(a;) a Universal generalization using (5) c) Let 3(3):) be “.1; is a movie produced by Sayles,” let e(a;) be “.1: is a movie about coal miners,” and let 24 Chapter 1 The Foundations: Logic and Proofs be “movie .7; is wonderful.” We are given premises —> and 32:(s(:r) A C(95)), and we want
to conclude 3:5(c(.1') A w(:i:)). In our proof, y represents an unspeciﬁed particular movie. Step Reason 1. 3.1:(s(:c) A Hypothesis 2. 5(y) A C(y) Existential instantiation using (1) 3. 3(1)) Simpliﬁcation using (2) 4. ‘d.r(s(a;) e4 w(:t)) Hypothesis ' 5. 3(1)) A w(y) Universal instantiation using (4) 6. w(y) Modus ponens using (3) and (5) 7. (1(3)) Simpliﬁcation using (2) 8. w(y) A c(,;;) Conjunction using (6) and (7) Q. El:r(c(:r:) A w(:L')) Existential generalization using (8)
d) Let be “:1: is in this class,” let be “.1: has been to France,” and let be “a: has visited the
Louvre.” We are given premises 3:1:(c(:1:) A f(.1;)), V(E(f(ft‘) #4 1(1)), and we want to conclude A l(:c)).
In our proof, y represents an unspeciﬁed particular person. Step Reason 1. Elsc(c(rc) /\f(:L')) Hypotl'iesis 2. c(y) A Existential instantiation using (1) 3. Simpliﬁcation using (2) 4. Simpliﬁcation using (2) 5. Vrc(f($) i) Hypothesis 6. a My) Universal instantiation using 7. [(y) Modus ponens using (3) and (6) 8. (:(y) A [(y) Conjunction using (4) and (7) 9. 337(c(.1:) A Existential generalization using (8) 16. a) This is correct, using universal instantiation and modus tollens. 18 20. 22. b) This is not correct. After applying universal instantiation, it contains the fallacy of denying the hypothesis. (3) After applying universal instantiation, it contains the fallacy of afﬁrming the conclusion. d) This is correct, using universal instantiation and modus ponens. . \Ve know that some 3 exists that makes S(s,i\*lax) true, but we cannot conclude that Max is one such 3. Therefore this ﬁrst step is invalid. b) This is valid; it is modus ponens. a) This is invalid. It is the fallacy of afﬁrming the conclusion. Letting a = 72 provides a counterexample. We will give an argument establishing the conclusion. \Ve want to show that all hummingbirds are small. Let Tweety be an arbitrary hummingbird. We must show that Tweety is small. The ﬁrst premise implies that if Tweety is a hummingbird, then Tweety is richly colored. Therefore by (universal) modus ponens we can conclude that Tweety is richly colored. The third premise implies that if Tweety does not live on honey, then Tweety is not richly colored. Therefore by (universal) modus tollens we can now conclude that Tweety does live on honey. Finally, the second premise implies that if Tweety is a large bird, then Tweety does not live on honey. Therefore again by (universal) modus tollens we can now conclude that Tweety is not a large bird, i.e., that Tweety is small, as desired. Notice that we invoke universal generalization as the last step. 24. Steps 3 and 5 are incorrect; simplification applies to conjunctions, not disjunctions. Section 1.5 26. 28. 30. 32. 34. Rules of Inference 25
We want. to show that the conditional statement P(0) —> R(a) is true for all e in the domain; the desired conclusion then follows by universal generalization. Thus we want to show that if P(a) is true for a partied far a, then [6(a) is also true. For such an a. by universal modus ponens from the first premise we have Q01), and then by universal modus ponens from the second premise we have 12((1), as desired. \Ve want to show that the conditional statement ﬁR(n) —> P(a) is true for all a in the domain; the desired
conclusion then follows by universal generalization. Thus we want to show that if —IR(o) is true for a partic—
ular a, then P(a) is also true. For such an a, universal modus tollens applied to. the second premise gives us
'(—rP(n,) /\ (2(a)). By rules from propositional logic, this gives us P(r1.) V 'Q(n) . By universal generalization
from the ﬁrst premise, we have P(a)VQ(a). Now by resolution we can conclude P(a)VP(a), which is logically
equivalent to 13(0), as desired. 1 Let a he “Allen is a good boy"; let h he “Hillary is a good girl”; let d be “David is happy.7 Then our assumptions are on V la. and a. V 0!. Using resolution gives us h V d, as desired. Vile apply resolution to give the tautology (1) V F) /\ (11) V F) —> (F V F). The leftshand side is equivalent to
pAnp, since pVF is equivalent to p, and —~pVF is equivalent to pp. The righthand side is equivalent to F.
Since the conditional statement is true, and the conclusion is false, it follows that the hypothesis, 3) /\ 'p, is
false, as desired. Let us use the following letters to stand for the relevant. propOsitions: d. for “logic is difﬁcult”; s for “many )3 students like logic”; and e for “mathematics is easy. Then the assumptions are d V 's and e } ad. Note
that the first of these is equivalent to s —> d, since both forms are false if and only if 3 is true and d is false.
In addition, let us note that the second assumption is equivalent to its contrapositive, d r we. And finally, by combining these two conditional statements, we see that s —> ee also follows from our assumptions. a) Here we are asked whether we can conclude that s —> we. As we noted abom, the answer is yes, this
conclusion is valid. b) The question concerns e —> —.s. This is equivalent to its contrapositive, s a» e. That doesn’t seem to
follow from our assumptions, so let’s find a case in which the assumptions hold but this conditional statement
does not. This conditional statement fails in the case in which .9 is true ands is false. If we take d to bc true
as well, then both of our assumptions are true. Therefore this conclusion is not valid. c) The issue is ﬁe V d, which is equivalent to the conditional statement. e 7) d. This does not follow from our
assumptions. If we take of to be false, 6 to be true, and s to bc false, then this proposition is false but our
assumptions are true. d) The iSSue is ad V ﬁe, which is equivalent to the conditional statement 0' a ﬁe. ‘rVe noted above that this
validly follows from our assumptions. e) This sentence says s —> (ﬁe V ml). The only case in which this is false is when 3 is false and both c and
d are true. But in this case, our assumption e a nd is also violated. Therefore, in all cases in which the
assumptions hold, this statement holds as well, so it is a valid conclusion. ...
View Full
Document
 Spring '09
 Ming

Click to edit the document details