54
Formal Logic
V(x): x is a vegetable
W(x, y): x wants y
a. Every child wants toys.
b. Only children want toys.
c. Some child wants only toys.
d. No child wants vegetables.
21. Using the predicate symbols shown and appropriate quantifiers, write each English language statement as
a predicate wff. (The domain is the whole world.)
J(x): x is a judge
L(x): x is a lawyer
W(x): x is a woman
C(x): x is a chemist
A(x, y): x admires y
a. There are some women lawyers who are chemists.
b. No woman is both a lawyer and a chemist.
c. Some lawyers admire only judges.
d. All judges admire only judges.
e. Only judges admire judges.
f. All women lawyers admire some judge.
g. Some women admire no lawyer.
22. Using the predicate symbols shown and appropriate quantifiers, write each English language statement as
a predicate wff. (The domain is the whole world.)
C(x): x is a Corvette
F(x): x is a Ferrari
P(x): x is a Porsche
S(x, y): x is slower than y
a. Nothing is both a Corvette and a Ferrari.
b. Some Porsches are slower than only Ferraris.
c. Only Corvettes are slower than Porsches.
d. All Ferraris are slower than some Corvettes.
e. Some Porsches are slower than no Corvette.
f. If there is a Corvette that is slower than a Ferrari, then all Corvettes are slower than all Ferraris.
23. Using the predicate symbols shown and appropriate quantifiers, write each English language statement as
a predicate wff. (The domain is the whole world.)
B(x):x is a bee
F(x): x is a flower
L(x, y): x loves y
a. All bees love all flowers.
d. Every bee hates only flowers.
b. Some bees love all flowers.
e. Only bees love flowers.
c. All bees love some flowers.
f. Every bee loves only flowers.