Back to forall x: Calgary

Complete truth tables

Building full truth tables for TFL sentences, marking the column for the whole sentence, and verifying the claims behind the bracketing conventions.

forall x: Calgary, Complete truth tables

Status
FlagsLoading your progress…

4 exercises

Exercise A

Complete truth tables for each of the following:

  1. A→AA\rightarrow A

  2. C→¬CC\rightarrow\neg C

  3. (A↔B)↔¬(A↔¬B)(A\leftrightarrow B)\leftrightarrow\neg(A\leftrightarrow\neg B)

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

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

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

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

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

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

3.0

Exercise B

Check all the claims made in introducing the new notational conventions in §10.3, i.e. show that:

  1. ‘((A∧B)∧C)((A\wedge B)\wedge C)’ and ‘(A∧(B∧C))(A\wedge(B\wedge C))’ have the same truth table

  2. ‘((A∨B)∨C)((A\vee B)\vee C)’ and ‘(A∨(B∨C))(A\vee(B\vee C))’ have the same truth table

  3. ‘((A∨B)∧C)((A\vee B)\wedge C)’ and ‘(A∨(B∧C))(A\vee(B\wedge C))’ do not have the same truth table

  4. ‘((A→B)→C)((A\rightarrow B)\rightarrow C)’ and ‘(A→(B→C))(A\rightarrow(B\rightarrow C))’ do not have the same truth table

Also, check whether:

  1. ‘((A↔B)↔C)((A\leftrightarrow B)\leftrightarrow C)’ and ‘(A↔(B↔C))(A\leftrightarrow(B\leftrightarrow C))’ have the same truth table

3.0

Exercise C

Write complete truth tables for the following sentences and mark the column that represents the possible truth values for the whole sentence.

  1. ¬(S↔(P→S))\neg(S\leftrightarrow(P\rightarrow S))

  2. ¬[(X∧Y)∨(X∨Y)]\neg[(X\wedge Y)\vee(X\vee Y)]

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

  4. [C↔(D∨E)]∧¬C[C\leftrightarrow(D\vee E)]\wedge\neg C

  5. ¬(G∧(B∧H))↔(G∨(B∨H))\neg(G\wedge(B\wedge H))\leftrightarrow(G\vee(B\vee H))

3.0

Exercise D

Write complete truth tables for the following sentences and mark the column that represents the possible truth values for the whole sentence.

  1. (D∧¬D)→G(D\wedge\neg D)\rightarrow G

  2. (¬P∨¬M)↔M(\neg P\vee\neg M)\leftrightarrow M

  3. ¬¬(¬A∧¬B)\neg\neg(\neg A\wedge\neg B)

  4. [(D∧R)→I]→¬(D∨R)[(D\wedge R)\rightarrow I]\rightarrow\neg(D\vee R)

  5. ¬[(D↔O)↔A]→(¬D∧O)\neg[(D\leftrightarrow O)\leftrightarrow A]\rightarrow(\neg D\wedge O)

If you want additional practice, you can construct truth tables for any of the sentences and arguments in the exercises for the previous chapter.

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.