Logical Equivalence
What You'll Learn
You'll learn how to determine when two different-looking logical statements always have the same truth value, making them logically equivalent.
The Core Idea
Two propositions are logically equivalent if they produce identical truth values in every possible scenario. Think of it like two different recipes that always produce the exact same cake—no matter what ingredients (input truth values) you start with, the outcome is always identical.
We verify logical equivalence by constructing truth tables for both propositions and comparing their final columns. If those columns match perfectly—row by row—the propositions are logically equivalent. We write this relationship using the symbol ≡ or ⇔.
How to Check for Logical Equivalence
- Build truth tables for both propositions, listing all possible combinations of truth values for the atomic propositions involved
- Compare the result columns: if they're identical in every row, the propositions are logically equivalent
- If even one row differs, they are not equivalent
Common Example
Consider De Morgan's Law: Is ¬(p ∧ q) equivalent to (¬p) ∨ (¬q)?
Build the truth table with all combinations for p and q, then evaluate both expressions. You'll find they match perfectly in every case—both are false only when p and q are both true, and true in all other cases.
Why This Matters
Logical equivalence lets us:
- Simplify complex logical expressions
- Substitute one form for another in proofs
- Recognize when two different statements say the same thing
- Transform expressions into more useful forms
Key Takeaway: Two propositions are logically equivalent if and only if their truth tables have identical result columns for all possible truth value assignments.