Lecture 05

About negating predicates with quantifiers

e.g. All BSAM students of UPMin are lefthanded.

Negation:
All BSAM students of UPMin are not lefthanded.
Not all BSAM students of UPMin are lefthanded.
*Recall: A proposition is a negation of a given
proposition if its truth value is always the opposite
of the truth value of the given for all combinations
of truth values.
Group I: LH1, LH2, LH3
Group II: LH1, LH2, RH1
Group III: RH1, RH2, RH3

All BSAM students All BSAM Not all BSAM

of UPMin are students of students of
lefthanded. UPMin are UPMin are
not lefthanded.
lefthanded.
Group I T F F
Group II F F T
Group III F T T
 Translating quantified statements
1. Every student in this class has studied calculus.
“For every student x in this class, x has studied calculus.”
“For every person x, if person x is a student in this class
then x has studied calculus.”

2. Some student in this class has visited Mexico.

“There is a student x in this class such that x has visited
Mexico.”
“There is a person x such that he is a student in this
class and has visited Mexico.”
 Nested Quantifiers
•D:  all real numbers

“For every real number x, there exists a real number y such

that x+y=0.”

•  (xy < 0))

“For every real number x and for every real number y, if x>0
and y<0, then xy<0.”
OR
“The product of a positive real number and a negative real
number is always a negative real number.”
 Order of Quantifiers
•Let  Q(x,y) denote “x+y=0.” What are the truth
values of (1) and (2).
Statement When True? When False?

P(x,y) is true for every pair There is a pair x,y for which
of x and y. P(x,y) is false.
For every x, there is a y for There is an x such that
which P(x,y) is true. P(x,y) is false for every y.
There is an x for which For every x there is a y for
P(x,y) is true for every y. which P(x,y) is false.
There is a pair x,y for which P(x,y) is false for every pair
P(x,y) is true. x,y.
Negating nested quantifiers
• Just
  apply rules for negating propositions with
single quantifiers.

e.g. Express the negation of the statement so

that no negation precedes a quantifier.
Rules of Inference for Quantified Statements

Rule of Inference Name

Universal instantiation

for an arbitrary c Universal generalization

Existential instantiation
for some element c
for some element c Existential generalization
Examples
1. Show that the premises “Everyone in this discrete
mathematics class has taken a course in computer
science” and “Marla is a student in this class” imply
the conclusion “Marla has taken a course in
computer science.”
2. Show that the premises “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.”
 Combination of Rules of Inference for
Propositions and Quantified Statements
•  Universal modus ponens

P(a), where a is a particular element in the domain

• Universal modus tollens

~Q(a), where a is a particular element in the domain

 Try this!

• For all positive integers n, if n

is greater than 4, then n2 is
less than 2n” is true. Use
universal modus ponens to
show that 1002 < 2100