1Checking only some rows
Two formulas are compared on a few convenient rows of the truth table, they agree there, and they are declared equivalent. Equivalence is a claim about every row, so agreement on some of them proves nothing.
Wrong turnError hereFor p→q and q→p, take p=q=T: both are T. Take p=q=F: both are T. The two formulas agree, so p→q≡q→p.
Right pathTwo variables give four rows. For (p,q) equal to (T,T), (T,F), (F,T), (F,F), the formula p→q takes the values T, F, T, T and q→p takes T, T, F, T. The columns differ in the rows (T,F) and (F,T), so the formulas are not equivalent: q→p is the converse of p→q. Why it happensThe rows where both variables have the same value are the easiest to evaluate, and agreement there feels like evidence. A truth table settles equivalence only when it is complete.
How to checkCount the rows first, 2n for n variables, and fill in every one. To refute an equivalence, one row with different values is enough; to confirm it, all 2n rows must match. 2Keeping the connective in De Morgan's law
The negation in front of a bracket is passed to each part inside, but the connective between the parts is left as it was. The result is not equivalent to the original formula.
Wrong turnError hereTo simplify ¬(P∧Q), apply the negation to each part, giving ¬P and ¬Q, and keep the ∧ between them: ¬(P∧Q)≡¬P∧¬Q.
Right pathAt P=T, Q=F, the conjunction P∧Q is F, so ¬(P∧Q) is T, while ¬P∧¬Q is F∧T, which is F. De Morgan's law changes the connective: ¬(P∧Q)≡¬P∨¬Q, and ¬P∨¬Q is F∨T, which is T in that row. In the same way, ¬(P∨Q)≡¬P∧¬Q. Why it happensThe negation is treated like a minus sign multiplied into a bracket, as in −(a+b)=−a+(−b), where the operation between the terms keeps its form. In words, "not both" gets heard as "neither". How to checkTest the row P=T, Q=F. "Not both P and Q" is true there, because Q is false, so the rewritten form must be T in that row too. 3Negating an implication into an implication
Asked to negate "if p, then q", the learner moves the negation onto the consequent and keeps the arrow, writing p→¬q. That formula is a different implication, not the negation. Wrong turnError here¬(p→q)≡p→¬q, so the negation of "if it rains, the ground is wet" would be "if it rains, the ground is not wet".
Right pathRewrite with material implication and De Morgan's law: ¬(p→q)≡¬(¬p∨q)≡¬¬p∧¬q≡p∧¬q. The wrong form fails at p=F, q=T: there p→q is T, so ¬(p→q) is F, but p→¬q is F→F, which is T. The negation is "it rains and the ground is not wet". Why it happensIn everyday speech, "it is not true that if it rains the ground is wet" sounds like a claim about what happens when it rains, so the "if" is kept. The negation of a conditional states a single case: the one row where p→q is F. How to checkThe negation of a formula must be T exactly where the formula is F. p→q is F only at p=T, q=F, so its negation must be T in that row and F in the other three. p∧¬q passes this test; p→¬q fails it, being T in both rows with p=F. 4Joining the antecedents with AND
Two implications with the same consequent, (p→r)∧(q→r), are merged by joining their antecedents with ∧, the connective that stands between the two implications. With a shared consequent the connective changes. Wrong turnError hereBy analogy with (p→q)∧(p→r)≡p→(q∧r), write (p→r)∧(q→r)≡(p∧q)→r.
Right pathAt p=T, q=F, r=F, the implication p→r is F, so the left side is F, while (p∧q)→r is F→F, which is T. With material implication and the distributive law: (¬p∨r)∧(¬q∨r)≡(¬p∧¬q)∨r≡¬(p∨q)∨r≡(p∨q)→r. Why it happensThe equivalences for a shared antecedent keep the connective, and the same is expected of a shared consequent. But once the arrow is rewritten, p→r≡¬p∨r, the antecedent stands under a negation, and De Morgan's law turns the connective over. How to checkRead it in words. "If it rains, the ground is wet, and if the sprinkler runs, the ground is wet" means the ground is wet when either one happens, which is (p∨q)→r. Or test the row p=T, q=F, r=F. 5Negating both sides of a biconditional
To negate p↔q, the negation is put on both sides, giving ¬p↔¬q. That formula is equivalent to p↔q itself, so it has the opposite value of the negation in every row. Wrong turnError here¬(p↔q)≡¬p↔¬q.
Right pathAt p=q=T, p↔q is T, so ¬(p↔q) is F, but ¬p↔¬q is F↔F, which is T. The negation goes on one side only: ¬(p↔q)≡p↔¬q≡¬p↔q, true exactly when p and q differ. Why it happensThe negation is distributed over the biconditional as if it were multiplied into a bracket. The row Negation Preservation in Biconditional in the table shows that negating both sides changes nothing, which is exactly why it cannot produce the negation.
How to checkCount the negations. A negation on one side flips the value of the biconditional, so two of them cancel and one negates. Test p=q=T: the negation must be F there.