Back to Using interpretations

Exercise C

Avg difficulty 3.0

Show that the following sentences are jointly satisfiable:

  1. M(a),¬N(a),Pa,¬Q(a)M(a),\neg N(a),Pa,\neg Q(a)

  2. L(e,e),L(e,g),¬L(g,e),¬L(g,g)L(e,e),L(e,g),\neg L(g,e),\neg L(g,g)

  3. ¬(M(a)∧∃x A(x)),Ma∨F(a),∀x(F(x)→A(x))\neg(M(a)\wedge\exists x\,A(x)),Ma\vee F(a),\forall x(F(x)\rightarrow A(x))

  4. M(a)∨M(b),M(a)→∀x¬M(x)M(a)\vee M(b),M(a)\rightarrow\forall x\neg M(x)

  5. ∀y G(y),∀x(G(x)→H(x)),∃y¬I(y)\forall y\,G(y),\forall x(G(x)\rightarrow H(x)),\exists y\neg I(y)

  6. ∃x(B(x)∨A(x)),∀x¬C(x),∀x[(A(x)∧B(x))→C(x)]\exists x(B(x)\vee A(x)),\forall x\neg C(x),\forall x\bigl[(A(x)\wedge B(x))\rightarrow C(x)\bigr]

  7. ∃x X(x),∃x Y(x),∀x(X(x)↔¬Y(x))\exists x\,X(x),\exists x\,Y(x),\forall x(X(x)\leftrightarrow\neg Y(x))

  8. ∀x(P(x)∨Q(x)),∃x¬(Q(x)∧P(x))\forall x(P(x)\vee Q(x)),\exists x\neg(Q(x)\wedge P(x))

  9. ∃z(N(z)∧O(z,z)),∀x∀y(O(x,y)→O(y,x))\exists z(N(z)\wedge O(z,z)),\forall x\forall y(O(x,y)\rightarrow O(y,x))

  10. ¬∃x∀y R(x,y),∀x∃y R(x,y)\neg\exists x\forall y\,R(x,y),\forall x\exists y\,R(x,y)

  11. ¬R(a,a)\neg R(a,a), ∀x(x=a∨R(x,a))\forall x(x=a\vee R(x,a))

  12. ∀x∀y∀z[(x=y∨y=z)∨x=z]\forall x\forall y\forall z[(x=y\vee y=z)\vee x=z], ∃x∃y ¬x=y\exists x\exists y\ \neg x=y

  13. ∃x∃y((Z(x)∧Z(y))∧x=y)\exists x\exists y((Z(x)\wedge Z(y))\wedge x=y), ¬Z(d)\neg Z(d), d=ed=e

Magnus et al., forall x: Calgary, Interpretations, Using interpretations, Exercise C

AI Tutor

Adapted from forall x: Calgary © 2025 P. D. Magnus, Tim Button, Robert Trueman, and Richard Zach. Licensed under CC BY 4.0. Source: forall x: Calgary. Imported at revision ec34df8.