Back to forall x: Calgary

Partial truth tables

Choosing between a complete table and a single strategically chosen line to settle equivalence, satisfiability and validity questions efficiently.

forall x: Calgary, Partial truth tables

Status
FlagsLoading your progress…

8 exercises

Exercise A

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)

3.0

Exercise B

Use complete or partial truth tables (as appropriate) to determine whether these sentences are jointly satisfiable, or jointly unsatisfiable:

  1. A∧BA\wedge B, C→¬BC\rightarrow\neg B, CC

  2. A→BA\rightarrow B, B→CB\rightarrow C, AA, ¬C\neg C

  3. A∨BA\vee B, B∨CB\vee C, C→¬AC\rightarrow\neg A

  4. AA, BB, CC, ¬D\neg D, ¬E\neg E, FF

3.0

Exercise C

Use complete or partial truth tables (as appropriate) to determine whether each argument is valid or invalid:

  1. A∨[A→(A↔A)]∴AA\vee\bigl[A\rightarrow(A\leftrightarrow A)\bigr]\therefore A

  2. A↔¬(B↔A)∴AA\leftrightarrow\neg(B\leftrightarrow A)\therefore A

  3. A→B,B∴AA\rightarrow B,B\therefore A

  4. A∨B,B∨C,¬B∴A∧CA\vee B,B\vee C,\neg B\therefore A\wedge C

  5. A↔B,B↔C∴A↔CA\leftrightarrow B,B\leftrightarrow C\therefore A\leftrightarrow C

3.0

Exercise D

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)]

3.0

Exercise E

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)]

3.0

Exercise G

Determine whether each collection of sentences is jointly satisfiable or jointly unsatisfiable. Justify your answer with a complete or partial truth table as appropriate.

  1. A→AA\rightarrow A, ¬A→¬A\neg A\rightarrow\neg A, A∧AA\wedge A, A∨AA\vee A

  2. A→¬AA\rightarrow\neg A, ¬A→A\neg A\rightarrow A

  3. A∨BA\vee B, A→CA\rightarrow C, B→CB\rightarrow C

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

  5. B∧(C∨A)B\wedge(C\vee A), A→BA\rightarrow B, ¬(B∨C)\neg(B\vee C)

  6. (A↔B)→B(A\leftrightarrow B)\rightarrow B, B→¬(A↔B)B\rightarrow\neg(A\leftrightarrow B), A∨BA\vee B

  7. A↔(B∨C)A\leftrightarrow(B\vee C), C→¬AC\rightarrow\neg A, A→¬BA\rightarrow\neg B

  8. A↔BA\leftrightarrow B, ¬B∨¬A\neg B\vee\neg A, A→BA\rightarrow B

  9. A↔BA\leftrightarrow B, A→CA\rightarrow C, B→DB\rightarrow D, ¬(C∨D)\neg(C\vee D)

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

3.0

Exercise H

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)

3.0

Exercise I

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

  1. A↔¬(B↔A)∴AA\leftrightarrow\neg(B\leftrightarrow A)\therefore A

  2. A∨BA\vee B, B∨CB\vee C, ¬A∴B∧C\neg A\therefore B\wedge C

  3. A→CA\rightarrow C, E→(D∨B)E\rightarrow(D\vee B), B→¬D∴(A∨C)∨(B→(E∧D))B\rightarrow\neg D\therefore(A\vee C)\vee(B\rightarrow(E\wedge D))

  4. A∨BA\vee B, C→AC\rightarrow A, C→B∴A→(B→C)C\rightarrow B\therefore A\rightarrow(B\rightarrow C)

  5. A→BA\rightarrow B, ¬B∨A∴A↔B\neg B\vee A\therefore A\leftrightarrow B

3.0

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.