Sunday, August 16, 2020

2:32 PM

L
P Predicates
U

Quantifiers
L
P
U
“Every computer connected to the university network is functioning properly

L
P
U

L
P
U

L
P
U

L
P
U

L
P
U

L
P
U

L
P
U

L
P
mth401 UNIT1 PART 2 Page 1
 L
P
U

L
P
U

L
P
U

L
P
U

L
P
U

L
P
U

L
P
U

• Universal quantifier
 Existential quantifier L

□ Uniqueness quantifier P
U
◊ Quantifiers with Restricted Domains
 Negating Quantified Expressions
 Translating into Logical Expressions

mth401 UNIT1 PART 2 Page 2

A predicate becomes a proposition when we assign it fixed values.
However, another way to make a predicate into a proposition is to
quantify it.
That is, the predicate is true (or false) for all possible values in the
L
universe of discourse or for some value(s) in the universe of P
discourse. U

Such quantification can be done with two quantifiers: the

L
universal quantifier and the existential quantifier. P
U

mth401 UNIT1 PART 2 Page 3

 L
P
U

L
P
The universal∀quantification of P(x) is the statement “P(x) for all values U
of x in the domain.”
∀
The notation xP(x) denotes the universal quantification of P(x).
L
Here ∀ is called the universal quantifier. We read xP(x) as “for all
∀ xP(x)” P
or “for every xP(x). U
” An element for which P(x) is false is called a counterexample to xP(x).

L
∀ P
Let P(x) be the statement “x + 1 > x.” What is the truth value of the U
quantification xP(x), where the domain consists of all real numbers?
L
P
U

L
P
U

∀
Let Q(x) be the statement “x < 2.” What is the truth value of the
L
quantification xQ(x), where the domain consists of all real numbers?
P
U

L
P
U

mth401 UNIT1 PART 2 Page 4

 ∀

What is the truth value of x(x ≥ x) if the domain consists of all real
L
numbers? What is the truth value of this statement if the domain
P
consists of all integers? U

L
P
U

The existential quantification of P(x) is the proposition

“There exists an element
∃ x in the domain such that P(x).”
L
P
U
We use the notation xP(x) for the existential quantification of P(x).
Here ∃ is called the existential quantifier.
L
∃ P
Let P(x) denote the statement “x > 3.” What is the truth value of the U
quantification xP(x),where the domain consists of all real numbers?
L
P
U

∃
Let Q(x) denote the statement “x = x + 1.” What is the truth
L
P
value of the quantification xQ(x),where the domain consists of U
all real numbers?

∃ ∃ ∃ ∃ L
P
the uniqueness quantifier, denoted by ! or 1.The notation !xP(x) [or U

1xP(x)] states “There exists a unique x such that P(x) is true.”

L
P
U

∀ ∀ ∃
L
What do the statements x < 0 (x2 > 0), y ≠ 0 (y3 ≠ 0), and z > 0
P
(z2 = 2) mean, where the U
domain in each case consists of the real numbers?

L
P
U

mth401 UNIT1 PART 2 Page 5

 L
Negating Quantified Expressions P
We will often want to consider the negation of a quantified expression. U
For instance, consider
the negation of the statement
L
“Every
∀ student in your class has taken a course in calculus.”
P
This statement is a universal quantification, namely, U

∃ xP(x),

x ¬P(x). L
P
U

L
P

∀ ∃ U

What are the negations of the statements x(x2 > x) and x(x2 = 2)?
L
P
U

L
P
U

What are the negations of the statements L

“There is an honest politician” P
U

L
P
U

∀ ∃ ∧

¬ x(P(x) → Q(x)) and x(P(x) ¬Q(x)) are

L
logically equivalent.
P
U

L
P
U

mth401 UNIT1 PART 2 Page 6

 L
P
U

L
P
U

L
P
U

L
P
U

L
P
U

Translate these statements into English, where

L
C(x) is “x is a comedian” and F(x) is “x is funny” P
U
and the domain consists of all people.
L
P
U

∀ L
∀ ∧ P
a) x(C(x) → F(x))
∃ U
b) x(C(x) F(x))
∃ ∧
c) x(C(x) → F(x))
L
d) x(C(x) F(x)) P
U

L
P
U

mth401 UNIT1 PART 2 Page 7

 L
P
Translate in two ways each of these statements into logical U
expressions using predicates, quantifiers, and logical
connectives.
First, let the domain consist of the students in your class and second, L
let it consist of all people. P

a) Someone in your class can speak Hindi. U

(b)Everyone in your class is friendly. L

P
U

c) There is a person in your class who was not born in

California.
L
P
U

d) A student in your class has been in a movie.

L
P

e) No student in your class has taken a course in logic U

programming.

L
P
Let P(x)=“x is a baby,” U

Q(x)=“x is logical"
R(x)=“x is able to manage a crocodile,”
S(x)=“x is despised,” L
be the statements P

Suppose that the domain consists of all people. U

Express each of these statements

using quantifiers; logical connectives.
L

a) Babies are illogical. ---∀x(P(x) → ¬Q(x)) P

U
b) Nobody is despised who can manage a crocodile. ---
c) Illogical persons are despised. ---
d) Babies cannot manage crocodiles.---

mth401 UNIT1 PART 2 Page 8

 L
P
U

L
P
U

mth401 UNIT1 PART 2 Page 9