\(\mathcal{M} = \langle E, \{0,1\}, \lexf\rangle\) with domain:

\[\begin{align*} E &= \{a,b,c,d,e\}\\ \lexf(\con{anna}) &= a\\ \lexf(\con{ben}) &= b\\ \lexf(\con{cara}) &= c\\ \lexf(\con{student}) &= \{a,b\}\\ \lexf(\con{linguist}) &= \{b,c\}\\ \lexf(\con{book}) &= \{d,e\}\\ \lexf(\con{admire}) &= \{(a,b),(b,c),(c,d)\}\\ \lexf(\con{read}) &= \{(a,d),(b,e),(c,d),(a,e)\}\\ \lexf(\con{recommend}) &= \{(a,d),(c,a),(c,d)\}\\ \end{align*}\]

Environment:

\[\begin{align*} g=\lbrace (x,a), (y,b)\rbrace \end{align*}\]
  1. State whether each atomic formula is true or false in :

    \[\begin{gather*} \con{student}\con{anna}\\ \con{book}\con{anna}\\ \con{linguist}\con{cara}\\ \con{admire}\con{ben}\con{anna}\\ \con{admire}\con{anna}\con{ben}\\ \end{gather*}\]
  2. Evaluate the following formulas in .

    \[\begin{gather*} \exists x.\con{student}x\\ \forall x.\con{student}x \rightarrow \con{linguist}x\\ \exists x.\con{student}x \land \con{linguist}x\\ \forall x.\con{book}x \rightarrow \con{student}x\\ \exists x\forall y. \con{admire}y\cnct x\\ \con{student}x\\ \con{linguist}x\\ \exists x.\con{admire}x\cnct y\\ \end{gather*}\]
  3. Translate the following sentences into FOL:
    1. Anna is a student.
    2. Ben read a book.
    3. Every student read a book.
    4. Some linguist recommended every book.
    5. No student recommended Ben.
    6. Not every student read a book.
    7. No book is read by every student.
    8. Some book is read by every student.
  4. Translate the following sentences into FOL; you are not allowed to use a cardinality predicate:
    1. Exactly one student laughed.
    2. At least two students laughed.
    3. No more than one student laughed.
  5. You have two predicates \(p\) and \(q\). Express the following situations in first order logic:

    1. there is no \(p\) that is not also \(q\).
    2. there is exactly one \(p\).
    3. there are exactly two \(p\)s.
    4. there is at most one \(p\).
🗝️

Evaluate the following formula in :

\[\exists x.\con{student}x\land \con{admire}x\con{cara}\land [\exists z. book'z \land \con{recommend} z\, x \to \forall y. \con{linguist}y \to \con{read}z\, y]\]

If the model does not satisfy the formula, suggest an alteration to the model, so that the formula is satisfied. Try to find a minimal alteration.

🗝️
  1. Build a model with exactly three individuals where the following are all true:
    • \(\exists x\,\con{student}x\);
    • \(\exists x\,\con{linguist}x\);
    • \(\neg\forall x\,\con{student}x\);
    • \(\exists x(\con{student}x\wedge \con{linguist}x)\);
    • \(\exists x\exists y\, \con{admire}(x,y)\).
  2. Build a model where the following set is inconsistent, and explain why:
    • \(\forall x(\con{student}x\rightarrow \con{read}(x,b))\);
    • \(\exists x\,\con{student}x\);
    • \(\forall x\,\neg \con{read}(x,b)\).
  3. Build a model where these are all true:
    • Every student admires some linguist.
    • No linguist admires Anna.
    • Anna admires Ben.