09 · Rules of Inference
Terminology
- Premise — a proposition assumed true (evidence) from which we reason.
- Conclusion — the proposition reached from the premises.
- Argument — a sequence of premises ending in a conclusion.
Valid argument
An argument is valid iff it is impossible for all premises to be TRUE while the conclusion is FALSE. Equivalently: is a tautology.
Validity ≠ truth
A valid argument can have false premises and a false conclusion. Validity is about form, not facts. “If the moon is cheese, I’m a king. The moon is cheese. ∴ I’m a king.” — valid (Modus Ponens), but unsound.
The 8 rules
| # | Rule | Form | Tautology |
|---|---|---|---|
| 1 | Modus Ponens | ||
| 2 | Modus Tollens | ||
| 3 | Hypothetical Syllogism | ||
| 4 | Disjunctive Syllogism | ||
| 5 | Addition | ||
| 6 | Simplification | ||
| 7 | Conjunction | ||
| 8 | Resolution |
Memory
- Ponens = “Put” — you put p in, q comes out.
- Tollens = “Take away” — take away q, p is taken away too.
- Resolution — the variable that appears as and cancels; glue what’s left.
❌ The two classic fallacies (GATE loves these)
| Fallacy | Form | Why it fails |
|---|---|---|
| Affirming the consequent | p = F, q = T makes premises T, conclusion F | |
| Denying the antecedent | same row: p = F, q = T |
“If I love cats then I love dogs. I love dogs. ∴ I love cats.” → affirming the consequent → invalid.
Building arguments
Part 1 (slides)
Premises: “Randy works hard” (H), “If Randy works hard, he is a dull boy” (H → D), “If Randy is a dull boy, he will not get the job” (D → ¬J). Conclusion: ¬J.
| Step | Statement | Reason |
|---|---|---|
| 1 | H | premise |
| 2 | H → D | premise |
| 3 | D | MP (1, 2) |
| 4 | D → ¬J | premise |
| 5 | ¬J | MP (3, 4) |
(Alternative: H → D, D → ¬J ⇒ H → ¬J by HS, then MP with H.)
Part 2 (slides)
Premises: “If it does not rain or it is not foggy, then the sailing race is held and the lifesaving demonstration goes on” ; “If the sailing race is held, the trophy is awarded” ; “The trophy was not awarded” . Conclusion: R.
| Step | Statement | Reason |
|---|---|---|
| 1 | , | premises |
| 2 | MT (1) | |
| 3 | ≡ | Addition, De Morgan |
| 4 | premise | |
| 5 | ≡ | MT (3, 4), De Morgan |
| 6 | Simplification |
Checking validity — “assume conclusion false” method
“If today is Tuesday, I have a test in Maths or Economics. If my Economics professor is sick, I will not have a test in Economics. Today is Tuesday and my Economics professor is sick. ∴ I have a test in Maths.”
, , , ∴ . Assume M = F with all premises T: ⇒ T = S = T; ⇒ E = F; then = T → F = F ❌. Can’t make all premises true with a false conclusion ⇒ valid.
Limitation of propositional logic
- ✅ Handles: “If it snows, we ski. It snows. ∴ We ski.” (MP)
- ❌ Can’t handle: “Everyone enrolled has lived in a dorm. Mia has never lived in a dorm. ∴ Mia is not enrolled.” — “everyone” needs quantifiers. Propositional logic treats each sentence as an unrelated atom p, q, r.
→ We need First Order Logic (predicate logic).
Prev ← 08 Logical Equivalences · Next → 10 Beyond the Slides