Chapter 1 Predicate Sand Quanti Fier
Chapter 1 Predicate Sand Quanti Fier
Chapter 1 Predicate Sand Quanti Fier
QUANTIFIERS
Solution:
Solution.
Finding the truth set of each predicate we have:
TP = {1, 2, 4} and TQ = {1, 2, 4, 8}.
Since every number appearing in TP also appears in TQ
then P(x) ⇒ Q(x)
Universal Quantifier
Definition:
The universal quantifier of P(x) is the proposition P(x) is
true for all values of x in the domain D, and is denoted by
∀ x ∈ D, P(x)
Solution.
A counterexample is x =1/2. Clearly, 1/2< 2 . Why? ½ > 1?
Nope! It is smaller , here. Right?
Example 3.5
Write in the form x∈ D, P(x) the proposition :” every real
number is either positive, negative or 0.”
Solution.
∀ x ∈ R, x > 0, x < 0, or x = 0
Existential Quantifier
Let L(x, y) be the predicate "x likes y," and let the
universe of discourse be the set of all people. Use
quantifiers to express each of the following
statements.
Solution.
Since 4 ∈R and 4 > 3, the given proposition is true.
The proposition ∀ x ∈ D,
P(x) → Q(x) is called
the universal conditional proposition.
Solution.
∀ x ∈ R, if x is an integer then x is a rational number.
Example 3.8
Solution.
a. ∃ x∈ D, ~ P(x).
b. ∀ x ∈ D, ~ P(x).
c. Since P(x)→ Q(x) = (~ P(x)) ∨ Q(x)
then ~ ( ∀ x ∈D, P(x) → Q(x))
Example 3.11
a. Let P(x, y) denote the statement ”x+y = y+x.”
What is the truth value of the proposition
( ∀ x∈R)( ∀ y ∈ R), P(x, y) ?
Solution.
a. The given proposition is always true.
Next, we discuss predicates that contain multiple
quantifiers
Example 3.11
b. Let Q(x, y) denote the statement ”x + y = 0.”
What is the truth value of the proposition
( ∃ y ∈ R)( ∀ x ∈R), Q(x, y)?
Solution.
b. The proposition is false.
For otherwise, one can choose x ≠ −y to obtain 0
≠ x + y = 0, which is impossible.
Example 3.12
Find the negation of the following propositions:
Solution.
a. ∃ x ∀y, ~ P(x, y).
b. ∀ x ∃ y, ~ P(x, y)
Quantifier Negation Rules:
∀ x , ∃ y, P(x,y).
Thank you