Translation into FOL Sentences

Let S(x) mean x is a skier, M(x) mean x is a mountain climber, and L(x,y) mean x likes y, where the domain of the first variable is Hoofers Club members, and the domain of the second variable is snow and rain. We can now translate the above English sentences into the following FOL wffs:

  1. Every member of the Hoofers Club is either a skier or a mountain climber or both.
    (∀x) S(x) ∨ M(x)

  2. No mountain climber likes rain.
    ¬(∃x) M(x) ∧ L(x, Rain)

  3. All skiers like snow.
    (∀x) S(x) ⇒ L(x, Snow)

  4. Ellen dislikes whatever Tony likes and likes whatever Tony dislikes.
    (∀y) L(Ellen, y) ⇔ ¬L(Tony, y)

  5. Tony likes rain.
    L(Tony, Rain)

  6. Tony likes snow.
    L(Tony, Snow)

  7. Query: Is there a member of the Hoofers Club who is a mountain climber but not a skier?
    (∃x) M(x) ∧ ¬S(x)

  8. Negation of the Query: There is no member of the Hoofers Club who is a mountain climber but not a skier.
    ¬(∃x) M(x) ∧ ¬S(x)