Professional Documents
Culture Documents
Lgica
de
Predicados
contains
3. Let
a) Q(Paris,
Italia)
b) Q(Madrid,
Espaa)
c) Q(Per,
Lima)
d) Q(Costa
Rica,
San
Jos)
=
5. 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) xP(x)
b) xP(x)
c) x P(x) d) x P(x)
Trabaje
y
solo
los
d.
incisos
a.
a) xP(x)
There exists a student who spends more than
five hours every weekday in class.
1
ICS 141: Discrete Mathematics I (Fall 2014)
b) xP(x)
Every student spends more than five hours
every weekday in class.
c) xP(x)
There exists a student who does not spend
more than five hours every weekday in class.
d) xP(x)
No student spends more than five hours every
weekday in class.
solo
los
d.
incisos
a.
a) P(0) b) P(1)
d) P(1)
Trabaje
c) P(2)
e) xP(x)
solo
d.
los
y
f) xP(x)
incisos
a.,
e.
solo
los
d.
incisos
a.
solo
c.
los
y
incisos
a.,
e.
Problem 4.
Translate each of these statements into logical
expressions using predicates, quantifiers, and
logical connectives:
P(x) x is perfect; F(x) x is your friend
a) No one is perfect: xP(x)
b) Not everyone is perfect: P(x)
c) All your friends are perfect: x[F(x) P(x)]
d) At least one of your friends is perfect: x[F(x)
P(x)]
e) Everyone is your friend and is perfect: x[F(x)
P(x)]
Trabaje
y
solo
los
d.
incisos
a.
Problem 7.
Express each of these statements using
quantifiers. Then form the negation of the
statement so that no negation is to the left of the
quantifier. Next express the negation in simple
English.
a) Some old dogs can learn new tricks.
O(x) x is old; T(x) x can learn new tricks
x[O(x) T(x)]
b) No rabbit knows calculus.
C(x) x knows calculus; Domain = all rabbits
xC(x)
c) Every bird can fly.
F(x) x can fly; B(x) x is a bird
x[B(x) F(x)]
d) There is no dog that can talk.
T(x) x can talk; Domain all dogs
xT(x)
e) There is no one in this class who knows French
and Russian.
F(x) x knows French; R(x) x knows
Russian; Domain class
x[F(x) R(x)]