Csci 2011 Discrete Mathematics: Lecture 5 - CH 1.4 Nested Quantifiers
Csci 2011 Discrete Mathematics: Lecture 5 - CH 1.4 Nested Quantifiers
Admin
Assignment 1: due Sep 17th
E-mail
CC TA for all of your e-mails. Put [2011] in front.
Recap
Propositional Function P(x) Universal quantifier: x P(x)
for all values of x, P(x) is true
You need to specify universe. Every variable has to be bound. Negating quatifiers
x P(x) = x P(x) x P(x) = x P(x)
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)
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
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)
xy (((x0) (y<0)) (x-y > 0)) xy (((x0) (y0)) (x-y > 0))
The difference between two non-positive numbers is not necessarily non-positive (i.e. can be positive)