Back to Partial truth tables

Exercise A

Avg difficulty 3.0

Use complete or partial truth tables (as appropriate) to determine whether these pairs of sentences are logically equivalent:

  1. AA, ¬A\neg A

  2. AA, A∨AA\vee A

  3. A→AA\rightarrow A, A↔AA\leftrightarrow A

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

  5. A∧¬AA\wedge\neg A, ¬B↔B\neg B\leftrightarrow B

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

  7. ¬(A→B)\neg(A\rightarrow B), ¬A→¬B\neg A\rightarrow\neg B

  8. (A→B)(A\rightarrow B), (¬B→¬A)(\neg B\rightarrow\neg A)

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

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.