1 / 19

Announcements

Announcements. Midterm tomorrow 3-4pm. Now you can debunk these ? (a sample from the web). Humans are mammals. Dogs are mammals. Humans are dogs. Then how am I typing this?. people make mistakes mistakes are wrong alex is a person alex is wrong.

becka
Télécharger la présentation

Announcements

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Announcements • Midterm tomorrow 3-4pm

  2. Now you can debunk these ?(a sample from the web) Humans are mammals.Dogs are mammals. Humans are dogs.Then how am I typing this? people make mistakesmistakes are wrongalex is a personalex is wrong 1. Theists (maybe not Jews) define God as all-powerful. 2. Therefore, God can lift any size rock. 3. Therefore, there can be no rock too big for God to lift.4. Therefore, God cannot create a rock too big for him to lift.5. Therefore, there is something God cannot do.6. Therefore, God is not all powerful.7. Therefore God does not exist (per the definition given by its believers).

  3. Lecture 10 1.5 Methods of Proof

  4. 1.5 Some Fallacious Proofs What’s wrong with this?

  5. 1.5 Premise 1: If Portland is the capital of Maine, then it is in Maine. Premise 2: Portland is in Maine. Conclusion: Portland is the capital of Maine. Application of the death penalty is killing a human being. Killing a human being is wrong. Therefore, application of the death penalty is wrong.

  6. 1.5 In this class we will learn the art of proving theorems. Some names: 1) Theorem, Proposition, Claim, Fact, Result: statement that can be proved. 2) axioms, postulates: the basic assumptions on which the proof us based. 3) lemma: intermediate result to be proved on your way to proof a theorem. 4) corollary: Result that is directly follows from a theorem you just proved. 5) Conjecture: A Result you think is true, but cannot prove. We use rules of inference to prove theorems. By using them wrong, we create fallacious proofs.

  7. 1.5 Rules of Inference(modus ponens – law of detachment) You can show that this is a tautology (i.e. it is always true) If the premises p and pq are both true, then q can only be true. However, if the premises do not hold, q can still be true or false, since then the rightmost implication is still true (FT)=T, (FF)=T

  8. 1.5 Rules of Inference simplification modus tollens conjunction addition disjunctive syllogism resolution hypothetical syllogism

  9. 1.5 Examples: it snows today If it snows today we go skiing Therefore: we go skiing If it rains we do not have a barbeque today If we don’t have a barbeque today, we’ll have one tomorrow Therefore: If it rains today, we’ll have a BBQ tomorrow.

  10. 1.5 Valid arguments. All inference rules were of the form: premise 1 is true, premise 2 is true, therefore conclusion is true. In general this looks like: For an argument to be true all the premises must be true. Example: if n>1 then n^2 > 1 (True) We cannot conclude (½)^2 > 1 because the premise is not true.

  11. Fallacies (revisited) If you do every problem in this book then you’ll learn discrete math. Joe didnot do every problem in the book, therefore he didnot learn discrete math. p = you do all problems in the book. q = you learned discrete math. correct wrong fallacy of denying hypothesis

  12. Fallacies (revisited) If you do every problem in this book then you’ll learn discrete math. Joe learned discrete math, therefore he did every problem in this book.... p = you do all problems in the book. q = do learned discrete math. correct wrong fallacy of affirming conclusion

  13. 1.5 Inference for Quantified Statements universal instantiation universal generalization existential generalization existential instantiation

  14. 1.5 Example: Everyone in this math class takes a CS course Marla is in this class Therefore: Marla takes a course in CS D(x) = x takes a math class C(x) = x takes a CS class. premises: conclusion: Reasoning: universal instantiation modus ponens

  15. Some more examples Example 10 p.74. All movies produced by John Sayles are wonderful John S. produced a movie about coal-miners Therefore: there a wonderful movie about coalminers. s(x) = x is a movie by John Sayles c(x) = x is a movie about coalminers w(x) = x is a wonderful movie.

  16. Examples If it does not rain or it is not foggy then the sailing race will go on and the lifesaving demonstration will go on. If the sailing is held, then the trophy will be awarded and the trophy was not awarded imply “it rained”. r = it rains f = it is foggy s = sailing race goes on l = lifesaving demonstration goes on. t = trophy awarded. combine premises as much as you can we want the conclusion “r” to be on the right side of the arrow

  17. Strategies for proving theorems Direct proof of implication pq Assume p = true and use rules of inference to prove that q is true. Indirect Proof of implication:: Assume q is not true, use rules of inference to prove that p is not true. (NOT q)  (NOT p) Proof by contradiction: Assume p is not true and use the rules of inference to prove a contradiction. (NOT p)  False

  18. Direct/Indirect Proofs Proof the following theorem: If n is an odd integer, then n^2 is an odd integer. assume p (n is an odd integer). n = 2k+1 for some integer k, Then: n^2 = (2k+1)^2 = 4k^2 + 4k + 1 = 2 ( 2k^2 + 2k) + 1 = 2m+1, m integer  Proof that if 3n+2 is odd, then n = odd. Assume (NOT q) : n = even. Then n = 2k, 3n+2 = 6k + 2 = 2(3k+1) = 2m. Thus, 3n+2 is even. We have proved (NOT q)  (NOT p) which is equivalent to pq 

  19. Contradiction Prove: p: At least 4 of any 22 days must fall on the same day of the week (the pigeonhole principle !). Assume (NOT p). Then at most 3 days of any 22 are the same day of the week. This implies that we could only have chosen 3x7=21 days, which is a contradiction with the fact that we had chosen 22 days to begin with. Thus (NOT p) = False  p = True.

More Related