Syllogism – Advanced Study Notes
(MIT‑Level, First Principles, Rigorous Reasoning, Edge Cases & Problem Set)
1. Introduction
A syllogism is a deductive argument consisting of two premises and one conclusion, all expressed as categorical propositions of the form
(P ;\text{is}; Q).
The classic form is the categorical syllogism:
| Premise 1 | Major premise (Universal)** |
|---|---|
| Premise 2 | Minor premise (Universal)** |
| Conclusion | Conclusion (Universal or Particular)** |
The objective is to deduce the conclusion with certainty from the two premises.
2. Foundations
2.1 Categorical Propositions
| Symbol | Meaning | Example |
|---|---|---|
| (A) | Universal affirmative | All A are B |
| (E) | Universal negative | No A are B |
| (I) | Particular affirmative | Some A are B |
| (O) | Particular negative | Some A are not B |
2.2 Quantifiers & Variables
- (x) ranges over a domain (D).
- Universal quantifier (\forall x) (for all).
- Existential quantifier (\exists x) (there exists).
2.3 Logical Equivalences
| Law | Statement | Symbolic form |
|---|---|---|
| De Morgan | ¬(A∧B) ≡ ¬A ∨ ¬B | |
| Contrapositive | (A → B) ≡ (¬B → ¬A) | |
| Distribution | A∧(B∨C) ≡ (A∧B) ∨ (A∧C) |
3. Formal Representation
Using predicate logic, a categorical proposition can be written as:
| Proposition | Predicate form | Example |
|---|---|---|
| All A are B | (\forall x (A(x) \rightarrow B(x))) | (\forall x (Cat(x) \rightarrow Animal(x))) |
| No A are B | (\forall x (A(x) \rightarrow \neg B(x))) | (\forall x (Cat(x) \rightarrow \neg Dog(x))) |
| Some A are B | (\exists x (A(x) \land B(x))) | (\exists x (Cat(x) \land Animal(x))) |
| Some A are not B | (\exists x (A(x) \land \neg B(x))) | (\exists x (Cat(x) \land \neg Dog(x))) |
Thus a syllogism becomes a logical inference:
[ \forall x (A(x) \rightarrow B(x)),; \forall x (B(x) \rightarrow C(x)) ;\vdash; \forall x (A(x) \rightarrow C(x)) ]
4. The Classical Syllogistic System (Cicero–Aristotle)
4.1 Figure and Mood
| Figure | Structure (Major, Minor, Conclusion) | Example |
|---|---|---|
| 1 | ( \text{Major: } \forall x (B \rightarrow C)) ( \text{Minor: } \forall x (A \rightarrow B)) ( \text{Conclusion: } \forall x (A \rightarrow C)) |
All humans are mortal. All Greeks are human. ⇒ All Greeks are mortal. |
| 2 | ( \text{Major: } \forall x (C \rightarrow B)) ( \text{Minor: } \forall x (A \rightarrow B)) ( \text{Conclusion: } \forall x (A \rightarrow C)) |
All mammals are warm‑blooded. All cats are mammals. ⇒ All cats are warm‑blooded. |
| 3 | ( \text{Major: } \forall x (B \rightarrow C)) ( \text{Minor: } \forall x (A \rightarrow B)) ( \text{Conclusion: } \exists x (A \land C)) |
All humans are mortal. Some Greeks are human. ⇒ Some Greeks are mortal. |
| 4 | ( \text{Major: } \forall x (C \rightarrow B)) ( \text{Minor: } \forall x (A \rightarrow B)) ( \text{Conclusion: } \exists x (A \land C)) |
All mammals are warm‑blooded. Some cats are mammals. ⇒ Some cats are warm‑blooded. |
The mood is the sequence of letters (A,E,I,O) for each premise and conclusion (e.g., AAA).
4.2 Rules of Validity
-
Conversion:
- A ↔ A (once)
- E ↔ E (once)
- I ↔ O (never)
-
Obversion:
- A ↔ E (switch subject/object, add negation)
- E ↔ A (same)
- I ↔ O (same)
-
Converse:
- A ↔ I (once)
- E ↔ E (never)
-
Addition:
- Add a new predicate (D) to the conclusion if it does not change truth value.
-
Transposition (Syllogistic):
- If (A \rightarrow B) and (B \rightarrow C), then (A \rightarrow C).
5. Advanced Topics
5.1 First‑Order Logic (FOL) Analysis
- Quantifier Scope: In syllogisms, all quantifiers are universal except possibly the conclusion, which may be existential.
- Skolemization: Eliminating existential quantifiers by introducing Skolem functions. For example, from ( \exists y , (A(y) \land B(y))) we may introduce a constant (c) such that (A(c) \land B(c)).
5.2 Edge Cases & Paradoxes
| Edge Case | Explanation | Resolution |
|---|---|---|
| Empty Domain | If the domain (D = \emptyset), all universal statements are vacuously true, but existential statements are false. | Many modern syllogistic systems assume a non‑empty domain to avoid trivial validity. |
| Contradictory Premises | ( \forall x (A \rightarrow B)) and ( \forall x (A \rightarrow \neg B)\ |