Back to Partial truth tables

Exercise E

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∨A)\neg(A\vee A)

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

  3. [(A→B)→A]→A[(A\rightarrow B)\rightarrow A]\rightarrow A

  4. ¬[(A→B)∨(B→A)]\neg[(A\rightarrow B)\vee(B\rightarrow A)]

  5. (A∧B)∨(A∨B)(A\wedge B)\vee(A\vee B)

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

  7. A→(B∨C)A\rightarrow(B\vee C)

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

  9. (B∧D)↔[A↔(A∨C)](B\wedge D)\leftrightarrow[A\leftrightarrow(A\vee C)]

  10. ¬[(A→B)∨(C→D)]\neg[(A\rightarrow B)\vee(C\rightarrow D)]

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

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.