Scribd
Upload
20 views

Discrete Structures Lecture 6

Uploaded by

acousticsak
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
20 views

Discrete Structures Lecture 6

Uploaded by

acousticsak
Copyright
© © All Rights Reserved
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
You are on page 1/ 15

CSD101 - Discrete Structures

(Discrete Mathematics)
Fall 2016

Lecture - 6
Rules of Inference with
Quantified Statements
Rules of Inference for the Universal Quantifier

• Assume that we know that x P(x) is true


• Then we can conclude that P(c) is true
• Here c is particular value in domain
• This is called “universal instantiation”
• Example: All women are wise therefore Lisa is wise.

• Assume that we know that P(c) is true for all value of c in


domain
• Then we can conclude that x P(x) is true
• This is called “universal generalization”
• Example: Student s has taken calculus therefore All students has
taken calculus.
Rules of Inference for the Existential Quantifier

• Assume that we know that x P(x) is true


• Then we can conclude that P(c) is true for some value of c
• This is called “existential instantiation”.
• Example: There is a fish in a pool therefore Some fish c is in pool.

• Assume that we know that P(c) is true for some value of c


• Then we can conclude that x P(x) is true
• This is called “existential generalization”.
• Example: Ali is in the store therefore There is a person in store.
Rules of Inference for Quantified Statements

Rule of Inference Name

∀xP(x)
Universal instantiation
∴ P(c)

P(c) for an arbitrary c


Universal generalization
∴ ∀xP(x)

∃xP(x)
Existential instantiation
∴ P(c) for some element c

P(c) for some element c


Existential generalization
∴ ∃xP(x)
Example
• Given the hypothesis:
“Everyone in this discrete mathematics class has taken a course in
computer science” and “Ali is in this discrete mathematics class”
imply the conclusion “Ali has taken a course in computer science.”

• Let D(x) = “x is in this discrete mathematics class,”


• Let C(x) = “x has taken a course in computer science.”

• The hypothesis are ∀x(D(x) → C(x)) and D(Ali).


• The conclusion is C(Ali).
Example
• The following steps can be used to establish the
conclusion from the hypothesis.

• Step Reason
1. ∀x(D(x) → C(x)) Hypothesis
2. D(Ali)→C(Ali) Universal instantiation from 1
3. D(Ali) Hypothesis
4. C(Ali) Modus ponens from 2 and 3
Example
• Given the hypothesis
“A student in this class has not read the book,” and “Everyone in this
class passed the first exam” imply the conclusion “Someone who
passed the first exam has not read the book.”

• Let C(x) = “x is in this class,”


• Let B(x) = “x has read the book,”
• Let P(x) = “x passed the first exam.”

• The hypothesis are ∃x(C(x)∧ ￢ B(x)) and ∀x(C(x) → P(x)).


• The conclusion is ∃x(P(x)∧ ￢ B(x)).
Example Proof

1. ∃x(C(x)∧ ￢ B(x)) Hypothesis


2. C(a)∧ ￢ B(a) Existential instantiation from 1
3. C(a) Simplification from 2
4. ∀x(C(x) → P(x)) Hypothesis
5. C(a) → P(a) Universal instantiation from 4
6. P(a) Modus ponens from 3 and 5
7. ￢ B(a) Simplification from 2
8. P(a)∧ ￢ B(a) Conjunction from 6 and 7
9. ∃x(P(x)∧ ￢ B(x)) Existential generalization
from 8
Universal Modus Ponens

• If x(P(x) Q(x)) is true, and if P(a) is true for a particular


element ‘a’ in the domain of the universal quantifier, then
Q(a) must also be true.

x(P(x) Q(x))
P(a), where a is a particular element in the domain
 Q(a)
Universal Modus Tollens

• If x(P(x) Q(x)) is true, and if Q(a) is false for a


particular element ‘a’ in the domain of the universal
quantifier, then P(a) must also be false.

x(P(x) Q(x))
¬Q(a), where a is a particular element in the domain
 ¬P(a)
Example of Proof

• Given the hypotheses:


• “Maria is a student in this class, owns a red convertible.”
• “Everybody who owns a red convertible has gotten at least one
speeding ticket”
• Can you conclude: “Somebody in this class has gotten a speeding
ticket”?

• Let C(x) = “x is student in class”.


• Let R(x) = “x has owns a red convertible”.
• Let T(x) = “x has gotten speeding ticket”.

• The hypothesis are x (R(x)→T(x)), C(Maria) and R(Maria).


• The conclusion is x (C(x)T(x)).
Example of Proof

1. x (R(x)→T(x)) Hypothesis
2. R(Maria) → T(Maria) Universal instantiation using 1
3. R(Maria) Hypothesis
4. T(Maria) Modes ponens using 2 and 3
5. C(Maria) Hypothesis
6. C(Maria)  T(Maria) Conjunction using 5 and 4
7. x (C(x)T(x)) Existential generalization
using 6
How do you know which one to use?
• Experience!

• In general, use quantifiers with statements like “for all” or


“there exists”
Chapter Reading
• Chapter 1, Kenneth H. Rosen, Discrete Mathematics and
Its Applications, Section 1.6
Exercise Questions

Q – 1, 2, 3, 4, 5, 6,13-b,13-d, 23, 24

You might also like