This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Show All Solutions Hide All Solutions Rosen, Discrete Mathematics and Its Applications, 6th edition Extra Examples
Section 1.5—Rules of Inference
— Page references correspond to locations of Extra Examples icons in the textbook. p.67, icon at Example 6 #1. The proposition (¬q ∧ (p → q )) → ¬p is a tautology, as the reader can check. It is the basis for the rule of inference modus tollens : ¬q p→q ... ¬p Suppose we are given the propositions: “If the class ﬁnishes Chapter 2, then they have a quiz” and “The class does not have a quiz.” Find a conclusion that can be drawn using modus tollens. Solution: Let p represent “The class ﬁnishes Chapter 2” and q represent “The class has a quiz.” According to modus tollens, because we have ¬q and p → q , we can conclude ¬p, or “The class did not ﬁnish Chapter 2.”
HideSolution See Solution p.67, icon at Example 6 #2. Suppose that “it is snowing” is true and that “it is windy” is true. Using the conjunction rule, what conclusion can be drawn?
See Solution HideSolution Solution: Using s for “it is snowing” and w for “it is windy,” we are given that s is true and w is true. By the conjunction rule, we can conclude s ∧ w, or “it is snowing and windy”. p.67, icon at Example 6 #3. Suppose “I have a dime or a quarter in my pocket” and “I do not have a dime in my pocket.” According to the disjunctive syllogism rule, what can we conclude? Solution: Using d for “I have a dime in my pocket” and q for “I have a quarter in my pocket”, we are given d ∨ q and ¬d. According to the disjunctive syllogism rule, we can conclude q , or “I have a quarter in my pocket.”
See Solution HideSolution p.67, icon at Example 6 #4. Determine whether this argument is valid by using a truth table: I play golf or tennis. 1 If it is not Sunday, I play golf and tennis. If it is Saturday or Sunday, then I don’t play golf. Therefore, I don’t play golf.
HideSolution See Solution Solution: Using the variables: g: t: s: u: I play golf I play tennis it is Saturday it is Sunday, the argument can be written in symbols as: g∨t ¬u → (g ∧ t) (s ∨ u) → ¬g ... ¬g We construct the truth table: g T T T T T T T T F F F F F F F F t T T T T F F F F T T T T F F F F s T T F F T T F F T T F F T T F F u T F T F T F T F T F T F T F T F g∨t T T T T T T T T T T T T F F F F ¬u → (g ∧ t) T T T T T F T F T F T F T F T F (s ∨ u) → ¬g F F F T F F F T T T T T T T T T ¬g F F F F F F F F T T T T T T T T In the fourth row the three hypotheses (columns 5, 6, 7) are true and the conclusion is false. Therefore, the argument is not valid. p.67, icon at Example 6 #5. Determine whether this argument is valid: Lynn works part time or full time. If Lynn does not play on the team, then she does not work part time. If Lynn plays on the team, she is busy. Lynn does not work full time. Therefore, Lynn is busy. 2 HideSolution See Solution Solution: Using the variables: p: f: t: b: Lynn Lynn Lynn Lynn works part time works full time plays on the team is busy, the argument can be written in symbols: p∨f ¬t → ¬p t→b ¬f ... b One method to ﬁnd whether the argument is valid is to construct the truth table: p T T T T T T T T F F F F F F F F f T T T T F F F F T T T T F F F F t T T F F T T F F T T F F T T F F b T F T F T F T F T F T F T F T F p∨f T T T T T T T T T T T T F F F F ¬t → ¬p T T F F T T F F T T T T T T T T t→b T F T T T F T T T F T T T F T T ¬f F F F F T T T T F F F F T T T T b T F T F T F T F T F T F T F T F We need to examine all cases where the hypotheses (columns 5, 6, 7, 8) are all true. There is only one case in which all four hypotheses are true (row 5), and in this case the conclusion is also true. Therefore, the argument is valid. Alternately, rules of logic can be used to give a proof that the argument is valid. We begin with the four hypotheses and show how to derive the conclusion, b. 1. p ∨ f 2. ¬t → ¬p 3. t → b 4. ¬f 5. p 6. p → t 7. t 8. b premise premise premise premise disjunctive syllogism on (1) and (4) contrapositive of (2) modus ponens on (5) and (6) modus ponens on (7) and (3) Note: This method can provide a relatively quick way to verify that an argument is valid. It requires that we be clever enough to be able to chain together valid argument forms that lead from the hypotheses to the conclusion. But suppose we do not have any idea whether the argument is valid. The truth table method will always enable us to determine whether or not the argument is valid — either the conclusion is true whenever the hypotheses are all true (argument is valid), or else there is a case where the hypotheses are true but the 3 conclusion if false (argument is not valid). However, using the rules of logic cannot tell us that the argument is not valid. If we use this technique on an argument and are unable to reach the conclusion, that does not tell us that the argument is not valid — someone else might still be able to reach the conclusion, which would mean that the argument is valid. p.68, icon at Example 8 #1. Suppose we have the two propositions (with symbols to represent them): “It is raining (r) or I work in the yard (w)” “It is not raining (¬r) or I go to the library (l).” What conclusion can we draw from these propositions? Solution: We can use the resolution rule of inference to draw a conclusion from these propositions. In symbols the two given propositions are (r ∨ w) ∧ (¬r ∨ l). From resolution we have (r ∨ w) ∧ (¬r ∨ l) → (w ∨ l). Therefore, we can draw the conclusion “I work in the yard or I go to the library.”
HideSolution See Solution p.71, icon at Example 12 #1. Suppose we have: “Every student in this class is a Junior.” “Every Junior in this class passed the ﬁnal exam.” “Allen is a student in this class.” Explain why we can draw the conclusion “Allen passed the ﬁnal exam.”
HideSolution See Solution Solution: We will use S (x) to mean “x is a student in this class”, J (x) to mean “x is a Junior”, and P (x) to mean “x passed the ﬁnal exam”, where the universe for x consists of all people. The proof is: 1. 2. 3. 4. 5. 6. 7. ∀x (S (x) → J (x)) ∀x(J (x) → P (x)) S (Allen) → J (Allen) J (Allen) → P (Allen) S (Allen) → P (Allen) S (Allen) P (Allen) premise premise universal instantiation on (1) universal instantiation on (2) hypothetical syllogism on (3) and (4) premise modus ponens on (5) and (6) 4 ...
View Full Document
This note was uploaded on 12/07/2011 for the course JAPANESE JP3248 taught by Professor Kuoda during the Spring '11 term at Université Stendhal Grenoble 3.
- Spring '11