In: Computer Science
Using the predicate symbols shown and appropriate quantifiers, write each English statement as a predicate wff. (The domain is the whole world.) (
A(x): x is an animal B(x): x is a bear H(x): x is hungry W(x): x is a wolf
a. Bears are animals.
b. Some animals are hungry bears.
c. No wolf is a bear.
Answer : (a.) Bears are animals.
If X is bear, then X is animal too.
∀ x B(x)→A(x)
b. Some animals are hungry bears .
Here there exists animal which are hungry bears, means B(x) /\ H(x).
∃ x A(x)→ (B(x) /\ H(x) )
c. No wolf is a bear
i.e . For all wolf they are not bear.
∀ x W(x)→ ¬ B(x)