Back to Semantic concepts

Exercise G

Avg difficulty 3.0

Determine whether each collection of sentences is jointly satisfiable or jointly unsatisfiable using a complete truth table.

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

  2. A∨BA\vee B, A→¬AA\rightarrow\neg A, B→¬BB\rightarrow\neg B

  3. ¬(¬A∨B)\neg(\neg A\vee B), A→¬CA\rightarrow\neg C, A→(B→C)A\rightarrow(B\rightarrow C)

  4. A→BA\rightarrow B, A∧¬BA\wedge\neg B

  5. A→(B→C)A\rightarrow(B\rightarrow C), (A→B)→C(A\rightarrow B)\rightarrow C, A→CA\rightarrow C

Magnus et al., forall x: Calgary, Truth tables, Semantic concepts, 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.