Logical equivalence and laws of logic
We build the truth table of a compound statement step by step: first list all value pairs of p and q (TT, TF, FT, FF), then fill the column of each part, and finally the column of the whole expression. Two statements give 4 rows, three statements give 2 · 2 · 2 = 8 rows. A statement that is true in every row is a tautology or law of logic; for example p ∨ ¬p is always true. If the last columns of two tables coincide, the statements are logically equivalent, written p ≡ q (or p ⇔ q). Two key equivalences are ¬(p ∧ q) ≡ ¬p ∨ ¬q and ¬(p ∨ q) ≡ ¬p ∧ ¬q: the negation of “both” is “at least one is not”, and the negation of “at least one” is “neither”.
A sign at a park gate says: “No entry with a bicycle or a scooter.” It means a visitor must have no bicycle and no scooter: ¬(b ∨ s) ≡ ¬b ∧ ¬s. Someone with only a scooter is stopped too, because one of the two is already enough.
Programmers simplify complicated conditions to reduce errors, circuit designers do the same job with fewer components, and editors check that a rulebook leaves no loophole.
Find a ban written with “or” at home or school (for example “no phones or headphones in lessons”). Rewrite it with “and” and check on two examples that both versions mean the same.
| p | q | p ∨ q | ¬(p ∨ q) | ¬p ∧ ¬q |
|---|---|---|---|---|
| T | T | T | F | F |
| T | F | T | F | F |
| F | T | T | F | F |
| F | F | F | T | T |
In pairs: one student says a statement (“I am right-handed and I know English”), the other says its negation using “or”, and together they check the equivalence with a table.