First-order logic (semantics)
\(\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*}\]- \[\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*}\]
- \[\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*}\]
- Translate the following sentences into FOL:
- Anna is a student.
- Ben read a book.
- Every student read a book.
- Some linguist recommended every book.
- No student recommended Ben.
- Not every student read a book.
- No book is read by every student.
- Some book is read by every student.
- Translate the following sentences into FOL; you are not allowed to use a
cardinality predicate:
- Exactly one student laughed.
- At least two students laughed.
- No more than one student laughed.
-
You have two predicates \(p\) and \(q\). Express the following situations in first order logic:
- there is no \(p\) that is not also \(q\).
- there is exactly one \(p\).
- there are exactly two \(p\)s.
- 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.
🗝️- 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)\).
- 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)\).
- Build a model where these are all true:
- Every student admires some linguist.
- No linguist admires Anna.
- Anna admires Ben.