Discrete Mathematics

(CSC 1204)

Chapter 1
1.3 Predicates and Quantifiers

1
 Agenda
• Predicate Logic
• Predicates
• Quantifiers
• Existential Quantifier, 
• Universal Quantifier, 

2
 Predicates
• Predicate: A property that the subject of the statement can
have.
Rahim is a boy
• Example: “ x > 3 ”
x: variable
>3: predicate
• We can denote the statement “x is greater than 3” by P(x),
where P denotes the predicate “is greater than” and x is the
variable. The statement P(x) is also said to be the value of the
propositional function P at x.
• P(x): x>3
– The value of the propositional function P at x
• Note: Once a value has been assigned to the variable x, the statement P(x)
becomes a proposition and has a truth value (either TRUE or FALSE)
3
 Example 1 (page 31)
• Let P(x) denote the statement “x>3”.
What are the truth values of P(4) and P(2)?

 Solution: Given ==> P(x) : “x>3”

• We obtain the statement P(4) by setting x=4 in the statement
“x>3”. Hence P(4), which is the statement “4>3”, is true.
• However, P(2) which is the statement “2>3”, is false.

4
 Example 2(Modified) @ page 31
• Let, A(x) : “Computer x is under attack by an intruder”.
Suppose that of the computers on campus, only C1 and C7
are currently under attack by intruders.
What are the truth values of A (C1), A(C3), A(C7)?
 Solution:
• A(C1): “Computer C1 is under attack by an intruder” is true
• A(C7): “Computer C7 is under attack by an intruder” is true
• A(C3): “Computer C3 is under attack by an intruder” is false
• Why ?
– Because C3 is not in the list of computers that are attacked by
intruders.

5
 Multivariable Predicates
• Multivariable Predicates ==> Predicates that have
more than one variable.
• For example, Q(x, y): “x = y + 3” ,
where x and y are variables and Q is the predicate.

 Note: When values are assigned to the variables x

and y, the statement Q(x, y) has a truth value.

6
 Example 3(page 31)

• Let Q(x, y) denote the statement “x = y + 3”.

What are the truth values of the propositions Q(1,2)
and Q(3,0)?
• Solution:
• To obtain Q(1,2), set x=1 and y=2 in the statement
Q(x,y).
Therefore, Q(1,2): “1=2+3” is false
Similarly, Q(3,0): “3=0+3” is true

7
 The Universal Quantifier
• Universal quantification: A predicate is true for every element.
• Definition: The universal quantification of P(x) is the
statement “P(x) for all values of x in the domain”.
–  is called the universal quantifier
“” reads “for all”
• The notation x P(x) denotes the universal quantification of
P(x).
• We read x P(x) as “for all x P(x)” or “for every x P(x)”
 An element for which P(x) is false is called a counterexample
of x P(x)

8
 The Universal Quantifier

• “x P (x)” true when every instance of x makes P (x)

true when plugged in

• Like taking conjunction over entire universe:

x P (x )  P (x1) P (x2)  P (x3)  …  P(xn)

9
 The Universal Quantifier
• Example 8 (page 34): Let P(x) be the statement “x+1>1”
What is the truth value of the quantification x P(x ),
where the domain consists of all positive integer
numbers?

• Solution: Because P(x) is true for all real numbers x, the

quantification x P (x ) is true.

10
 The Universal Quantifier
• Example 9(page 35): Let Q(x) be the statement “x<2”.
What is the truth value of the quantification x Q(x ),
where the domain consists of all real numbers?
• Solution: Q(x) is not true for every real number x,
because, for instance, Q(3) is false. That is, x=3 is a
counterexample for the statement x Q(x ).
Thus, x Q(x ), is false

11
 The Universal Quantifier
• (Modified) Example 10 (page 35): Let P(x) be the
statement “x2>0”. What is the truth value of the
quantification x P(x ), where the universe of
discourse consists of all integers?
• Solution: P(x) is not true for all integers.
We can give a counter example. We see that x=0 is a
counterexample, because x2 = 0 when x = 0,
so that x2 is not greater than 0 when x = 0.
Therefore, x P(x ) is false.

12
 The Universal Quantifier
• Example 11 (page 35): What is the truth value of x P(x ),
where P(x) is the statement “x2<10” and the domain consists of
the positive integers not exceeding 4?

• Solution: The statement x P(x ) is the same as the

conjunction P(1)  P(2)  P(3)  P(4), because the domain
consists of the integers 1, 2, 3, and 4.
Because P(4), which is the statement “42<10”, is false, it follows
that x P(x ) is false.

13
 The Universal Quantifier
• Quiz: What is the truth value of x P(x ), where P(x) is the
statement “x2<10” and the domain consists of the positive
integers less than 4?
• Solution: The statement x P(x ) is the same as the
conjunction P(1)  P(2)  P(3) , because the domain consists of
the integers 1, 2, 3.
So, x P(x ) is true.
How?----------See Below------------------------------------------------
P(1): “12<10”, is true
P(2): “22<10” is true
P(3): “32<10” is true

14
 The Existential Quantifier
• Definition: The existential quantification of P(x) is the
proposition “There exists an element x in the domain such that
P(x)”.
– Existential quantification: There is one or more elements for
which a predicate is true.
“” reads “there exists”
• We denote the existential quantification of P(x) by x P(x)
•  is called the existential quantifier.
• Existential quantification x P(x) is read as:
– “There is an x such that P(x)”,
– “There is at least one x such that P(x)”, or
– “for some x P(x)”

15
 The Existential Quantifier
• “x P (x)” is true when an instance can be found
which when plugged in for x, makes P (x) true.

• Like taking disjunction over entire universe

x P (x )  P (x1)  P (x2)  P (x3)  … P(xn)

16
 The Existential Quantifier
• Example 14 (page 36):Let P(x) denote the statement “x>3”.
What is the truth value of the quantification x P (x)” , where
the domain consists of all real numbers?

• Solution: Because “x>3” is sometimes true –for instance,

when x=4, the existential quantification of P(x) ,
which is x P (x), is true.

17
 The Existential Quantifier
• Example 16(page 37): What is the truth value of
x P(x), where P(x) is the statement “x2>10” and the universe
of discourse consists of the positive integers not exceeding 4?

• Solution: Because the domain is { 1, 2, 3, 4}, the proposition

x P(x) is the same as the disjunction
P(1) P(2)  P(3) P(4) .
Because P(4), which is the statement “42>10” , is true, it
follows that x P(x) is true.

18
 The Existential Quantifier
• Example 15(page 36):Let Q(x) denote the statement
“x=x+1”. What is the truth value of the quantification
x Q(x), where the domain consists of all real
numbers?
• Solution: Because Q(x) is false for every real number
x, the existential quantification of Q(x), which is
x Q(x), is false.

19
Universal & Existential Quantifiers:
When True? When False?

20
 Class Work
1. Let P(x) denote the statement “x>0”. What is the truth value
of the quantification x P (x)” , where the domain consists of
integers?
2. Let P(x) denote the statement “x>0”. What is the truth value
of the quantification x P (x)” , where the domain consists of
positive integers?
3. Let P(x) denote the statement “x>0”. What is the truth value
of the quantification x P (x)” , where the domain consists of
negative integers?
4. Let P(x) denote the statement “x<2”. What is the truth value
of the quantification x P (x)” , where the domain consists of
all prime numbers?

21