Scribd
Upload
172 views

Nested Quantifiers

The document discusses nested quantifiers and translating between English statements and quantified logical statements. It covers: - Using multiple quantifiers like "For all x, there exists a y such that P(x,y)" and "There exists an x such that for all y, P(x,y) is true". - The order of quantifiers matters as "There exists an x such that for all y P(x,y)" and "For all x, there exists a y such that P(x,y)" are not equivalent. - Negating statements with multiple quantifiers by changing the quantifier(s) and negating the predicate, such as "It is not the case that

Uploaded by

Mohomed Athif
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
172 views

Nested Quantifiers

The document discusses nested quantifiers and translating between English statements and quantified logical statements. It covers: - Using multiple quantifiers like "For all x, there exists a y such that P(x,y)" and "There exists an x such that for all y, P(x,y) is true". - The order of quantifiers matters as "There exists an x such that for all y P(x,y)" and "For all x, there exists a y such that P(x,y)" are not equivalent. - Negating statements with multiple quantifiers by changing the quantifier(s) and negating the predicate, such as "It is not the case that

Uploaded by

Mohomed Athif
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 12

Nested Quantifiers

CS/APMA 202, Spring 2005


Rosen, section 1.4
Aaron Bloomfield

Multiple quantifiers
You can have multiple quantifiers on a statement
xy P(x, y)

For all x, there exists a y such that P(x,y)


Example: xy (x+y == 0)

xy P(x,y)

There exists an x such that for all y P(x,y) is true


xy (x*y == 0)
2

Order of quantifiers
xy and xy are not equivalent!
xy P(x,y)

P(x,y) = (x+y == 0) is false

xy P(x,y)

P(x,y) = (x+y == 0) is true

Negating multiple quantifiers


Recall negation rules for single quantifiers:

x P(x) = x P(x)
x P(x) = x P(x)
Essentially, you change the quantifier(s), and negate
what its quantifying

Examples:

(xy P(x,y))

= x y P(x,y)
= xy P(x,y)

(xyz P(x,y,z))

= xyz P(x,y,z)
= xyz P(x,y,z)
= xyz P(x,y,z)
4

Negating multiple quantifiers 2


Consider (xy P(x,y)) = xy P(x,y)

The left side is saying for all x, there exists a y such


that P is true
To disprove it (negate it), you need to show that there
exists an x such that for all y, P is false

Consider (xy P(x,y)) = xy P(x,y)

The left side is saying there exists an x such that for


all y, P is true
To disprove it (negate it), you need to show that for
all x, there exists a y such that P is false
5

Translating between English and


quantifiers
Rosen, section 1.4, question 20
The product of two negative integers is positive

xy ((x<0) (y<0) (xy > 0))


Why conditional instead of and?

The average of two positive integers is positive

xy ((x>0) (y>0) ((x+y)/2 > 0))

The difference of two negative integers is not necessarily


negative

xy ((x<0) (y<0) (x-y0))


Why and instead of conditional?

The absolute value of the sum of two integers does not


exceed the sum of the absolute values of these integers

xy (|x+y| |x| + |y|)

Translating between English and


quantifiers
Rosen, section 1.4, question 24
xy (x+y = y)

There exists an additive identity for all real numbers

xy (((x0) (y<0)) (x-y > 0))

A non-negative number minus a negative number is


greater than zero

xy (((x0) (y0)) (x-y > 0))

The difference between two non-positive numbers is


not necessarily non-positive (i.e. can be positive)

xy (((x0) (y0)) (xy 0))

The product of two non-zero numbers is non-zero if


and only if both factors are non-zero

Rosen, section 1.4 question 30


Rewrite these statements so that the negations
only appear within the predicates
yx P(x,y)
yx P(x,y)
yx P(x,y)

xy P(x,y)

xy P(x,y)
xy P(x,y)

y (Q(y) x R(x,y))

y (Q(y) x R(x,y))
y (Q(y) (x R(x,y)))
y (Q(y) x R(x,y))
9

Rosen, section 1.4 question 31


Express the negations of each of these statements so
that all negation symbols immediately precede
predicates.
xyz T(x,y,z)

(xyz T(x,y,z))
xyz T(x,y,z)
xyz T(x,y,z)
xyz T(x,y,z)
xyz T(x,y,z)

xy P(x,y) xy Q(x,y)

(xy P(x,y) xy Q(x,y))


xy P(x,y) xy Q(x,y)
xy P(x,y) xy Q(x,y)
xy P(x,y) xy Q(x,y)
10

Quick survey

a)
b)
c)
d)

I felt I understood the material in this


slide set
Very well
With some review, Ill be good
Not really
Not at all

11

Quick survey

a)
b)
c)
d)

The pace of the lecture for this


slide set was
Fast
About right
A little slow
Too slow

12

Quick survey

a)
b)
c)
d)

How interesting was the material


in this slide set? Be honest!
Wow! That was SOOOOOO cool!
Somewhat interesting
Rather borting
Zzzzzzzzzzz

13

You might also like