Back to Partial truth tables

Exercise H

Avg difficulty 3.0

Determine whether each argument is valid or invalid. Justify your answer with a complete or partial truth table as appropriate.

  1. A→(A∧¬A)∴¬AA\rightarrow(A\wedge\neg A)\therefore\neg A

  2. A∨BA\vee B, A→BA\rightarrow B, B→A∴A↔BB\rightarrow A\therefore A\leftrightarrow B

  3. A∨(B→A)∴¬A→¬BA\vee(B\rightarrow A)\therefore\neg A\rightarrow\neg B

  4. A∨BA\vee B, A→BA\rightarrow B, B→A∴A∧BB\rightarrow A\therefore A\wedge B

  5. (B∧A)→C(B\wedge A)\rightarrow C, (C∧A)→B∴(C∧B)→A(C\wedge A)\rightarrow B\therefore(C\wedge B)\rightarrow A

  6. ¬(¬A∨¬B)\neg(\neg A\vee\neg B), A→¬C∴A→(B→C)A\rightarrow\neg C\therefore A\rightarrow(B\rightarrow C)

  7. A∧(B→C)A\wedge(B\rightarrow C), ¬C∧(¬B→¬A)∴C∧¬C\neg C\wedge(\neg B\rightarrow\neg A)\therefore C\wedge\neg C

  8. A∧BA\wedge B, ¬A→¬C\neg A\rightarrow\neg C, B→¬D∴A∨BB\rightarrow\neg D\therefore A\vee B

  9. A→B∴(A∧B)∨(¬A∧¬B)A\rightarrow B\therefore(A\wedge B)\vee(\neg A\wedge\neg B)

  10. ¬A→B\neg A\rightarrow B,¬B→C\neg B\rightarrow C,¬C→A∴¬A→(¬B∨¬C)\neg C\rightarrow A\therefore\neg A\rightarrow(\neg B\vee\neg C)

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

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.