The following exercises cover the use of truth tables to check whether a formula is a tautology, whether two formulas are logically equivalent, and whether an argument is valid.

1. Simple truth tables

Populate the truth table for each formula. Sentence-letter columns are pre-filled. Click each ? cell to cycle through T and F, then click Check to verify your answers.
1.1   ¬(p ∧ q) Open ↗
1.2   ¬(p → q) Open ↗
1.3   (p ∧ (q → ¬r)) Open ↗
1.4   (p → (q ∨ r)) Open ↗
1.5   (p ∨ ¬(q ∧ r)) Open ↗

2. Tautologies

A formula is a tautology if and only if it is true under every assignment of truth values. Use the Build card to construct the truth table. Then click Evaluate in the Check card to determine whether it is a tautology. If it is not, a counterexample row will be highlighted in red.
2.1   ((p ∧ ¬q) → ¬(p → q)) Open ↗
2.2   (p → (q → p)) Open ↗
2.3   ((p ∨ q) → (p ∧ q)) Open ↗
2.4   ((p → (q → r)) → ((p → q) → r)) Open ↗

3. Logical equivalence

Two formulas are logically equivalent if they have the same truth value on every row. Use the Build card to construct the truth table for each formula. Then click Evaluate in the Check card. Rows where the truth values differ will be highlighted.
3.1   ¬(p ∧ q)   and   (¬p ∨ q) Open ↗
3.2   (p ∧ ¬q)   and   ¬(p → q) Open ↗
3.3   (p → (q → r))   and   ((p → q) → r) Open ↗

4. Validity

An argument is valid if there is no assignment making all premises true and the conclusion false. Premises are listed first; the conclusion is the last formula. Click Evaluate in the Check card. Counterexample rows will be highlighted in red.
4.1   (p → q), ¬p    ⊨    ¬q Open ↗
4.2   (p → q), (p ∨ q)    ⊨    q Open ↗
4.3   (p → q), ¬(p ∧ q), ¬q    ⊨    (p → q) Open ↗
4.4   (p → q), (q → r), ¬r    ⊨    (p → r) Open ↗
4.5   ((p ∧ q) → r), (p ∧ ¬r)    ⊨    ¬q Open ↗
4.6   (p → (q ∧ r)), (¬q ∨ ¬r)    ⊨    (p → ¬q) Open ↗
4.7   p    ⊨    (q → ((p ∨ r) → (q ∧ r))) Open ↗