Back to Partial truth tables

Exercise D

Avg difficulty 3.0

Determine whether each sentence is a tautology, a contradiction, or a contingent sentence. Justify your answer with a complete or partial truth table as appropriate.

  1. A→¬AA\rightarrow\neg A

  2. A→(A∧(A∨B))A\rightarrow(A\wedge(A\vee B))

  3. (A→B)↔(B→A)(A\rightarrow B)\leftrightarrow(B\rightarrow A)

  4. A→¬(A∧(A∨B))A\rightarrow\neg(A\wedge(A\vee B))

  5. ¬B→[(¬A∧A)∨B]\neg B\rightarrow[(\neg A\wedge A)\vee B]

  6. ¬(A∨B)↔(¬A∧¬B)\neg(A\vee B)\leftrightarrow(\neg A\wedge\neg B)

  7. [(A∧B)∧C]→B[(A\wedge B)\wedge C]\rightarrow B

  8. ¬[(C∨A)∨B]\neg\bigl[(C\vee A)\vee B\bigr]

  9. [(A∧B)∧¬(A∧B)]∧C\bigl[(A\wedge B)\wedge\neg(A\wedge B)\bigr]\wedge C

  10. (A∧B)]→[(A∧C)∨(B∧D)](A\wedge B)]\rightarrow[(A\wedge C)\vee(B\wedge D)]

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

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.