#### Question

Using the predicate symbols shown and appropriate quantifiers, write each English language 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. No wolf is a bear. c. Only bears are hungry. d. If all wolves are hungry, so are bears. e. Some animals are hungry bears. f. Bears are hungry but some wolves are not. g. If wolves and bears are hungry, so are all animals. h. Some wolves are hungry but not every animal is hungry.

Verified

#### Step 1

1 of 9

$\textbf{a.}$ Since the sentence talks about $\textbf{all}$ bears, we will use the universal quantifier. The universal quantifier often goes together with implication.

So, this sentence can be thought of as For every being $x$, if $x$ is a bear, then $x$ is an animal'', which can pretty much directly be translated to:

$\begin{equation*} \textcolor{#c34632}{(\forall x)(B(x)\rightarrow A(x))}\text. \end{equation*}$

## Create an account to view solutions

#### Introduction to Cryptography

2nd EditionJohannes Buchmann

#### Mathematical Structures for Computer Science: A Modern Approach to Discrete Mathematics

6th EditionJudith L. Gersting
1,615 solutions

#### Mathematical Structures for Computer Science: Discrete Mathematics and its Applications

7th EditionJudith L. Gersting
2,287 solutions

#### Mathematical Structures for Computer Science

7th EditionJudith L. Gersting
2,287 solutions