This preview shows pages 1–12. 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 DocumentThis 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 DocumentThis 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: 51ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiICS141: Discrete Mathematics for Computer Science IDepartment of Information and Computer SciencesUniversity of HawaiiStephen Y. Itoga52ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiLecture 5Chapter 1. The Foundations1.5 Rules of Inference1.6 Introduction to Proofs53ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiSome material in these slides were taken/adapted from the slides made by Prof. Michael P. Frank and Prof. Jonathan L. Gross which are provided through the publisher of “Discrete Mathematics and Its Applications” written by Kenneth H. Rosen.Some slides were made by Prof. Baek54ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiValid ArgumentsA form of logical argument is validif whenever every premise is true, the conclusion is also true. A form of argument that is not valid is called a fallacy.55ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiInference Rules: General FormAn Inference Ruleis A pattern establishing that if we know that a set of premisestatements of certain forms are all true, then we can validly deduce that a certain related conclusionstatement is true. premise 1premise 2 ···.∴conclusion “∴” means “therefore”56ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiInference Rules & ImplicationsEach valid logical inference rule corresponds to an implication that is a tautology.premise 1 premise 2 Inference rule···.∴conclusionCorresponding tautology: ((premise 1) ∧(premise 2) ∧…) →conclusion57ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiModus Ponensp Rule of modus ponensp→q(a.k.a. law of detachment)∴q(p ∧(p→q)) →q is a tautology“the mode of affirming”pqp →qp ∧(p→q)(p ∧(p→q)) →qTTTTTTFFFTFTTFTFFTFTNotice that the first row is the only one where premises are all true 58ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiModus Ponens: Examplep→q : “If it snows today then we will go skiing”p .: “It is snowing today”∴q : “We will go skiing”p→q : “If nis divisible by 3 then n2is divisible by 3”p .: “nis divisible by 3”∴q : “n2is divisible by 3”IfThenAssumed TRUEis TRUEIfThenAssumed TRUEis TRUE59ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiModus Tollens¬q Rule of modus tollens p→q∴¬p(¬q ∧(p→q)) →¬p is a tautologyExamplep→q : “If this jewel is really a diamond then it will scratch glass”¬q .: “The jewel doesn’t scratch glass”∴¬p : “The jewel is not a diamond”“the mode of denying”IfAssumed TRUEThenis TRUE510ICS 141: Discrete Mathematics I (Spr 2008)University of HawaiiMore Inference RulespRule of Addition∴p∨q p →(p∨q)p∧qRule of Simplification∴p p∧q →ppqRule of Conjunction∴p∧q (p)∧(q) →p∧q 511ICS 141: Discrete Mathematics I (Spr 2008)University of Hawaii...
View
Full
Document
This note was uploaded on 09/12/2008 for the course ICS 141 taught by Professor Idk during the Fall '08 term at Hawaii.
 Fall '08
 IDK

Click to edit the document details