03-proof - CSIS1118 Foundations of Computer Science Methods...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
CSIS1118 oundations of Computer Science Foundations of Computer Science Methods of Proof Hubert Chan ([O1,O2]; Chapters 1.6, 1.7, 4.1) 1
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Logical Inference xample: If Peter did it he will be nervous when he is questioned Peter Example: If Peter did it, he will be nervous when he is questioned. Peter was very nervous when he was questioned. Therefore, Peter did it. Is the “argument” valid? An argument is called valid if whenever all the hypotheses are true, the conclusion is also true. p: Peter did it q: Peter is nervous when he is questioned he argument: The argument: p q q -------- Is (p q) q p a tautology? p No, if p is F, q is T, the proposition is false! 2
Background image of page 2
Exercise: If horses fly or cows eat plastic, then the mosquito is the national bird. If the mosquito is the national bird, then peanut butter tastes good on hot dogs. But peanut butter tastes terrible on hot dogs. Therefore, cows don’t eat plastic. Does the conclusion “cow don’t eat plastic” follow the arguments? et p denote “horses fly” ) Let p denote horses fly q denote “cows eat plastic” r denote “mosquito is the national bird” s denote “peanut butter tastes good on hot dogs” (p q) r r s s ---------------  q Q: Is it possible that the argument is valid, but the conclusion is not true? 3
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Example 1. If 2000 is divisible by 9, then (2000) 2 is divisible by 9. 2. 2000 is divisible by 9 So, (2000) 2 is divisible by 9 Is the argument valid? Is the statement “(2000) 2 is divisible by 9” true? No, because a false proposition is used in the argument! Q: If the argument is not valid, can the conclusion be true? Yes, then the proof (argument) is wrong!! Example: 1. If 12 is divisible by 3, then 12 is divisible by 4 2. 12 is divisible by 4 So, 12 is divisible by 3 he argument is not valid but 4 ,y The argument is not valid, but the conclusion is true
Background image of page 4
Some “rule of inference” [Textbook, Table 1, p.66] p (p q) (p q) p [p (p q)] q [ q (p q)]  p All these are tautologies! Do you know how to prove it? [(p q) (q r)] (p r) [(p q)  p] q [(p q) ( p r) (q r) ow about for predicates and quantifiers? How about for predicates and quantifiers? 5
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Universal Instantiation x P(x) Existential Generalization P(c) for some c U Universal Generalization P(c) for any c U ------------------ P(c) if c U -------------------------  x P(x) -------------------------  x P(x) xistential Instantiation U: universe of discourse Existential Instantiation x P(x) ------------------------- P(c) for some c U Example: Every man has two legs. John is a man.
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/05/2012 for the course FBE BUSI1007 taught by Professor Lin during the Spring '11 term at HKU.

Page1 / 25

03-proof - CSIS1118 Foundations of Computer Science Methods...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online