Show that (p ∧ q) → p is a tautology.
- p = T, q = T: p ∧ q = T, and T → T is T.
- p = T, q = F: p ∧ q = F, and F → T is T.
- p = F, q = T: p ∧ q = F, and F → F is T.
- p = F, q = F: p ∧ q = F, and F → F is T.
Answer: The statement is true in all four rows, so it is a tautology.