14 · Memory Tricks & Traps
🧠 Memory tricks
| To remember | Trick |
|---|---|
| Precedence ¬ ∧ ∨ → ↔ | “Not All Ostriches Imitate Birds” |
| p → q false only for T → F | Broken promise: “If you score 100%, you get a trophy” — only broken if you score 100% and get nothing. Truth can’t imply falsehood. |
| False hypothesis ⇒ implication true | ”A promise not triggered can’t be broken.” |
| Sufficient vs necessary in p → q | ”Sufficient Starts, Necessary Next” — p (start) sufficient, q (next) necessary |
| ”only if" | "Only if points forward” — what follows “only if” goes on the right of → |
| “unless" | "Unless = OR” — “A unless B” = A ∨ B |
| Converse / inverse / contrapositive | Converse = swap, Inverse = negate, Contrapositive = swap + negate (only the last is safe) |
| ⊕ | “Odd one out” — true when an odd number of inputs are true |
| ↔ | “Twins” — true when both are the same |
| De Morgan | ”Break the bar, change the sign” — split ¬ across, flip ∧ ↔ ∨ |
| Absorption | “The big eats the small” — p swallows anything that already contains p |
| ”Not-p or q” — say it aloud: “either p fails, or q holds" | |
| "p happened, q didn’t” = | |
| Same-consequent identities | Connective flips when you pull the shared consequent out: (p→r) ∧ (q→r) = (p ∨ q) → r |
| Modus Ponens / Tollens | Ponens = Put in, Tollens = Take away |
| Resolution | ”Cancel the clash” — drop the p / ¬p pair, OR the leftovers |
| Valid argument | ”No row with all premises T and conclusion F” |
| Tautology test | ”Try to break it” — assume F; if you can’t, it’s a tautology |
| Liar puzzles | ”Speaker ↔ Statement” — always |
⚠️ Edge cases & traps
Propositions
- “x is even” → not a proposition (free variable).
- “There is life on Mars” → is a proposition (unknown ≠ no truth value).
- “This sentence is false” → not a proposition (paradox).
- Commands, questions, wishes → not propositions.
Connectives
- “or” in English is ambiguous — decide inclusive vs exclusive from context (“soup or salad comes with the meal” is exclusive).
- “but” = ∧, not some new connective.
- Vacuous truth: “If 2 + 2 = 5, then I’m the Pope” is TRUE.
- does not mean p causes q — no causal link needed (“If Delhi is India’s capital, Beijing is China’s capital” is TRUE).
Implication phrasing
- “p only if q” ≠ “p if q”. First is p → q, second is q → p.
- “q is necessary for p” = p → q (not q → p!).
- “unless” is not “if not” in the biconditional sense — “I’ll go unless it rains” doesn’t promise you won’t go if it rains.
- Converse ≢ implication. GATE loves options that state the converse.
Precedence & structure
- → is not associative; ↔ and ⊕ are.
- ≠ .
- Negating ↔: negate ONE side (); negating BOTH sides gives back the original.
- The negation of an implication is never an implication: .
- NAND / NOR are not associative.
Tautology / validity
- Invalid ≠ contradiction. Contingencies are invalid too.
- “Satisfiable but not valid” = contingency.
- Valid argument can have false premises — validity is about form.
- is a tautology (counter-intuitive!).
- An argument with inconsistent premises is valid (vacuously — premises can never all be true).
Inference
- Affirming the consequent (p→q, q ∴ p) — invalid.
- Denying the antecedent (p→q, ¬p ∴ ¬q) — invalid.
- Modus Tollens needs ¬q, not ¬p.
Puzzles
- “I am a knight” gives no information.
- A knave can’t say anything that would be true because he is a knave (e.g. “I’m a knave or …”).
- “X iff I’m telling the truth” ⇒ X is true, whoever speaks.
- “Cannot be determined” is a valid answer — don’t force a unique solution.
Counting
- Rows = , functions = — don’t mix them up.
- When counting satisfying assignments, include variables that don’t appear in a clause (they multiply the count by 2).
Prev ← 13 Flashcards · Next → 15 Cheat Sheet