Exercise 1.

3
Predicate and Quantifiers
•Q1. Let P (x) denote the statement "x 4." What
are the truth values?
a) P(0) b) P (4) c) P (6)
Solution:
b) T, since 0 ≤ 4
b) T, since 4 ≤ 4
c) F, since 6 ≤ 4
•Q2. Let P (x) be the statement "x spends more
than five hours every weekday in class," where
the domain for x consists of all students. Express
each of these quantifications in English.
a.
There is a student who spends more than five
hours every weekday in class.
b.
Every student spends more than five hours
every weekday in class.
•c.
There is a student who does not spend more
than five hours every weekday in class.
d.
No student spends more than five hours every
weekday in class
Q7.
• Translate these statements into English, where
C (x ) is "x is a comedian" and F (x) is "x is funny" and the
domain consists of all people.
a.
For all people if the person is comedian then the person us
funny or All comedian are funny
b.
For all people the person is comedian and funny
c.
There exist a person such that if the person is comedian
then the person us funny
d.
There exist a person who is comedian and funny
Q9.
• Let P (x) be the statement "x can speak Russian" and let
Q(x) be the statement "x knows the computer language C++."
Express each of these sentences in terms of P (x), Q (x),
quantifiers, and logical connectives. The domain for quantifiers
consists of all students at your school.
a) There is a student at your school who can speak Russian and
who knows C++.
b) There is a student at your school who can speak Russian but
who doesn't know C++.
c) Every student at your school either can speak Russian or
knows C++.
d) No student at your school can speak Russian or knows C++.
•Q11. Let P (x) be the statement " ." If the
domain consists of the integers, what are the
truth values?
a) P(0) T
b) P(1) T
c) P (-1) F
d) T
e) P (2) F
f) x P (x) F
Q13.
• Determine the truth value of each of these
statements if the domain consists of all integers.
a) n(n + 1 > n )
True.
b) n (n = -n)
True, e.g., for n = 0.
c ) n (2n = 3n)
True, e.g., for n = 0
d)
False, e.g., for n = −1.
•Q17. Suppose that the domain of the
propositional function P (x) consists of the
integers 0, 1, 2, 3, and 4. Write out each of
these propositions using disjunctions,
conjunctions, and negations. a) ∃xP (x) b) ∀xP
(x) c) ∃x¬P (x) d) ∀x¬P (x) e) ¬∃xP (x) f) ¬∀xP
(x)
a. ∃xP (x) means that there exist a value x for
which P(x)is true, thus P(0)is true or P(1)is
true or P(2)is true or P(3)is true or P(4)is true.
Using the above interpretation of symbols we
can rewrite the proposition then as
•b. xP (x) means that for all possible values x
P(x)is true,thus P(0)is true andP(1)is true and
P(2)is true and P(3)is true and P(4)is true. Using
the above interpretation of symbols we can
rewrite the proposition then as
c. ∃xP (x) means that there exist a value x for
which P(x)is true,thus P(0)is true or P(1)is true or
P(2)is true or P(3)is true or P(4)is true. Using the
above interpretation of symbols we can rewrite
the proposition then as
d) ∀x¬P(x)
Same as b) except add a "not" in front of P(x)
¬P(0) ∧ ¬P(1) ∧ ¬P(2) ∧ ¬P(3) ∧ ¬P(4)

e) ¬∃xP(x)
"There does not exist" + P(x)
Therefore we put not in front of all P(x) as well
as use "and" since there is non
¬P(0) ∧ ¬P(1) ∧ ¬P(2) ∧ ¬P(3) ∧ ¬P(4)

f) ¬∀xP(x)
Same as above except use "or" since its the negation of "for all"

¬P(0) ∨ ¬P(1) ∨ ¬P(2) ∨ ¬P(3) ∨ ¬P(4)

25. Translate each of these statements into logical
expressions using predicates, quantifiers, and logical
connectives.
a) No one is perfect.
No one is perfect. == Not ( one is perfect) = ~
(∃x(px))= ∀x ~p(x)= Every one is imperfect.
b) Not everyone is perfect.
Not everyone is perfect.== Not (everyone is perfect.)=
~( ∀x(px))=∃x ~p(x)= Atleast one is imperfect.
c) All your friends are perfect.
All your friends are perfect. == if there is a person who
is your friend then he is perfect== ∀x( F(x)→P(x))
.
d) At least one of your friends is
perfect
At least one of your friends is perfect.
== There is a person who is your
friend who is perfect.
• ∃x (F(x)∧P(x))
Q23. Translate in two ways each of these statements into logical
•expressions using predicates, quantifiers, and logical connectives. First,
let the domain consist of the students in your class and second, let it
consist of all people.
Let C(x) be the propositional function “x is in your class”.
a) Someone in your class can speak Hindi.
xH(x) and x(C(x) (H(x)), where H(x) is “x can speak Hindi”.
b) Everyone in your class is friendly.
F(x) and x(C(x) → F(x)), where F(x) is “x is friendly”.
c) There is a person in your class who was not born in California.
x¬B(x) and x(C(x) ¬B(x)), where B(x) is “x was born in California”.
d) A student in your class has been in a movie.
xM(x) and x(C(x) M(x)), where M(x) is “x has been in a movie”.
e) No student in your class has taken a course in logic programming.
x¬L(x) and x(C(x) → ¬L(x)), where L(x) is “x has taken a course in logic
programming”.
•Q30. Suppose the domain of propositional
function P(x,y) consists of pairs x and y, where x is
1, 2, or 3 and y is 1, 2 or 3. Write out these
propositions using disjunctions and conjunctions.
a. ∃ x P( x , 3)
• P(1,3 )∨ P(2,3) ∨P(3,3 )
b. x P( 1,y)

c. ∃ y¬ P(2, y )
• ¬P(2,1)∨¬ P(2,2 )∨¬P(2,3)
d. x P( x , 2)
Q33. Express each of these statements using quantifiers. Then form the
•
negation of the statements so that no negation is to the left of a quantifier.
Next, express the negation in simple English
a) All dogs have fleas.
Let x denotes dog and the predicate” x has fleas”is denoted by P(x)
So the given statement in logical expression is
Negation of this is
It is simple English means that “there is a dog which does not have fleas”
b) There is a horse that can add.
Let x denotes horse and the predicate ” x can add” dented by P(x)
So the logical expression is and the negation is
It is simple english means that “no horse can add”
c) Every koala can climb.
Let x denotes koala and the predicate “x can climb” denoted by P(x)
So the given statement in logical expression is
Negation of this is
In English: There is a koala which can’t climb.
•d) No monkey can speak French.
Let x denotes monkey and the predicate” x can
speak french”is denoted by P(x)
So the given statement in logical expression is
Negation of this is
In English: There is a monkey which can speak
French.