5 - Multiple quantifiers and negating sentences

Statements with multiple quantifiers

Order usually matters! If there is only a single type of quantifier order does not matter.

For example:
Screen Shot 2023-09-14 at 3.00.59 PM.png

is not the same as:
Screen Shot 2023-09-14 at 3.01.13 PM.png

Negation of statements

Screen Shot 2023-09-14 at 3.02.27 PM.png
Screen Shot 2023-09-14 at 3.06.43 PM.png
Screen Shot 2023-09-14 at 3.06.25 PM.png Screen Shot 2023-09-14 at 3.06.34 PM.png Screen Shot 2023-09-14 at 3.07.07 PM.png

Upper bound/lower bound

Upper bound: every thing in the set
Lower bound: every thing in the set

In class practice

P(x) ¬Q(X)



HW 5

Ben Finch

E 5.1
a) x2 or x3
b) x>3 and x2
c) x>3 and x4 and x2=16
d) 3<x<4 and 9x216
e) (x=2 or x=3) and x25x+60
f) For some xR, it happens that x2+2x0
g) For every xR, x2+2x0
h) There exists an xR such that for all yR it holds that yx2
i) For every xR, there exists some yR such that yx2
j) There exists an ε>0 such that for every δ>0, there exists an xR such that 0<|x2|<δ and |x24|ε

E 5.2
a) These two statements don't have the same truth value. The first is saying "for every x in the real numbers, there exists some y such that x+y=0" which is true. The second is saying, "there exists some y in the real numbers, such that for each x in the real numbers, x+y=0" which is false.
b) These two statements do have the same truth value, since both are true in all cases.
c) These two statements don't have the same truth value for similar reasons to part a. The first statement is true, but the second one is false.
d) These statements don't have the same truth value for similar reasons to parts a & c. The first statement is true, but the second one is false.

E 5.3
a) (3, 17). The upper bound is 17. It does not have a greatest element because for any number in the set, you can always find another number that is greater but still less than 17.

b) It is impossible for a set to have a greatest element and not have an upper bound. If a set has a greatest element, then that greatest element is by definition an upper bound of the set.

E 5.4
a) Yes, it is 1.
b) Yes, it is also 1.
c) Yes, it is 0.
d) No. You can always get a smaller element by infinitely increasing n.

E 5.5
a) Yes, for example 2.
b) No.
c) Yes, for example -1.
d) No.

E 5.6
a) xS,yS,y>x
b)yS,y>x
c) zR,yS,y>z