Back to Partial truth tables

Exercise G

Avg difficulty 3.0

Determine whether each collection of sentences is jointly satisfiable or jointly unsatisfiable. Justify your answer with a complete or partial truth table as appropriate.

  1. A→AA\rightarrow A, ¬A→¬A\neg A\rightarrow\neg A, A∧AA\wedge A, A∨AA\vee A

  2. A→¬AA\rightarrow\neg A, ¬A→A\neg A\rightarrow A

  3. A∨BA\vee B, A→CA\rightarrow C, B→CB\rightarrow C

  4. A∨BA\vee B, A→CA\rightarrow C, B→CB\rightarrow C, ¬C\neg C

  5. B∧(C∨A)B\wedge(C\vee A), A→BA\rightarrow B, ¬(B∨C)\neg(B\vee C)

  6. (A↔B)→B(A\leftrightarrow B)\rightarrow B, B→¬(A↔B)B\rightarrow\neg(A\leftrightarrow B), A∨BA\vee B

  7. A↔(B∨C)A\leftrightarrow(B\vee C), C→¬AC\rightarrow\neg A, A→¬BA\rightarrow\neg B

  8. A↔BA\leftrightarrow B, ¬B∨¬A\neg B\vee\neg A, A→BA\rightarrow B

  9. A↔BA\leftrightarrow B, A→CA\rightarrow C, B→DB\rightarrow D, ¬(C∨D)\neg(C\vee D)

  10. ¬(A∧¬B)\neg(A\wedge\neg B), B→¬AB\rightarrow\neg A, ¬B\neg B

Magnus et al., forall x: Calgary, Truth tables, Partial truth tables, Exercise G

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.