FOL 09 · Fallacies & Rules of Inference for Quantified Statements
Fallacies (recap)
A fallacy is an argument that looks right but is invalid.
| Fallacy | Form | Example |
|---|---|---|
| Affirming the conclusion (consequent) | If it’s Monday, John goes to work. John goes to work. ∴ It’s Monday. ❌ | |
| Denying the hypothesis (antecedent) | If Socrates is human, he is mortal. He’s not human. ∴ Not mortal. ❌ |
Both fail on the row p = F, q = T: premises true, conclusion false.
The four quantifier rules
| Rule | Form | Use it to… | Condition |
|---|---|---|---|
| Universal Instantiation (UI) | apply a “for all” to a specific element | c is any element | |
| Universal Generalization (UG) | for arbitrary c | conclude a “for all” | c must be arbitrary — no special assumptions about it |
| Existential Instantiation (EI) | for some c | name the witness | c must be a new name, not used before |
| Existential Generalization (EG) | for some c | conclude a “there exists” | — |
Memory — " Instantiate = drop the quantifier, Generalize = add it"
Universal = “all” (UI free to pick any c; UG needs an arbitrary c). Existential = “some” (EI needs a fresh c; EG from any known c).
The EI trap
From and you cannot conclude . EI gives and then with a different fresh name d — c and d need not be the same element.
Combined rules
Universal Modus Ponens = UI + MP All men are mortal. Socrates is a man. ∴ Socrates is mortal.
Universal Modus Tollens = UI + MT All parrots like fruit. Charlie doesn’t like fruit. ∴ Charlie is not a parrot.
Slide proofs
"All students in this class understand logic. David is a student in this class. ∴ David understands logic."
# Step Reason 1 premise 2 premise 3 UI (1) 4 MP (2, 3)
, ⊢
# Step Reason 1–2 premises 3 UI (1), c arbitrary 4 UI (2) 5 Hypothetical syllogism 6 UG (5) — legal because c was arbitrary
⊢
# Step Reason 1 premise 2 EI (1) 3 Simplification 4 EG (3) 5 Simplification (2) 6 EG (5) 7 Conjunction The reverse direction fails — see FOL 03 Quantifier Equivalences.
The Mia argument (from Chapter 1), finally solved
E(x): x is enrolled, D(x): x has lived in a dormitory. , ∴ — Universal Modus Tollens ✅
🏠 Slide homework — solved
(a) "Every CS major takes discrete maths. Ria takes discrete maths. ∴ Ria is a CS major."
, ∴ — invalid: affirming the conclusion (universal form). Ria could be a maths major taking DM.
(b) "Everyone who eats granola every day is healthy. Linda is not healthy. ∴ Linda does not eat granola every day."
, ∴ — valid: universal modus tollens.
Prev ← FOL 08 Resolution · Next → FOL 10 Beyond the Slides