Question

If the domain consists of all animals, express the following statements in terms of quantifiers and logical connectives, where B ( x ) = x is a bear, G ( x ) = x raids garbage cans, H ( x ) = x loves honey, and T ( x ) = lives in tents.

1. A bear lives in a tent.
2. Bears love honey.
3. Only bears raid garbage cans.
4. No bear lives in a tent.
5. Some bears do not love honey.

Answer 1

1. A bear lives in a tent

It will written as for all x, if there is bear then it lives in tents

2. Bears love honey

It will written an for all x, if it is bear then it loves honey

3. Only bears raid garbage cans

It will written as if there is x who raid garbage cans, then x must be bear.

4. No bear lives in a tent

It will return as for every x, if it is bear, then it never lives in a tent.

5. Some bear do not loves honey.

It will written as there is some bear who doesn't loves honey.