Syllogism – Advanced Study Notes
(Reasoning Ability – MIT‑Level)
1. Introduction
A syllogism is a deductive argument that uses two premises to derive a conclusion.
The classic form is:
All A are B.
All B are C.
Therefore, all A are C.
The term originates from the ancient Greek logician Aristotle (384–322 BCE), who formalised it in Prior Analytics.
2. First‑Principles Foundations
2.1 Logical Language
We formalise syllogisms in first‑order logic (FOL).
- Predicates: (P(x)) means “(x) is a (P)” (e.g., (S(x)): “(x) is a student”).
- Quantifiers: (\forall) (for all), (\exists) (there exists).
- Logical Connectives: (\land) (and), (\lor) (or), (\Rightarrow) (implies), (\lnot) (not).
A categorical proposition (“All A are B”) translates to: [ \forall x,(A(x) \Rightarrow B(x)) ]
2.2 The Four Standard Forms
Aristotle identified four categorical propositions:
| Symbol | Form | Meaning | Logical Form |
|---|---|---|---|
| A | Universal affirmative | All (A) are (B) | (\forall x(Ax \Rightarrow Bx)) |
| E | Universal negative | No (A) are (B) | (\forall x(Ax \Rightarrow \lnot Bx)) |
| I | Particular affirmative | Some (A) are (B) | (\exists x(Ax \land Bx)) |
| O | Particular negative | Some (A) are not (B) | (\exists x(Ax \land \lnot Bx)) |
2.3 Structure of a Syllogism
A syllogism has:
- Two premises (major and minor).
- One conclusion.
- Three terms: major term (predicate of conclusion), minor term (subject of conclusion), middle term (common to both premises).
Example:
| Premise | Symbolic form | Term roles |
|---|---|---|
| All (B) are (C) | (\forall x(Bx \Rightarrow Cx)) | Major premise – (B) is middle, (C) is major |
| All (A) are (B) | (\forall x(Ax \Rightarrow Bx)) | Minor premise – (A) is minor, (B) is middle |
| Therefore, all (A) are (C) | (\forall x(Ax \Rightarrow Cx)) | Conclusion – (A) is minor, (C) is major |
3. Formal Proof Schema
A syllogism is valid iff the conclusion follows logically from the premises.
We can prove validity by substitution:
- From (\forall x(Ax \Rightarrow Bx)) pick an arbitrary (a) such that (Aa).
- Deduce (Ba).
- From (\forall x(Bx \Rightarrow Cx)) deduce (Ca).
- Conclude (\forall x(Ax \Rightarrow Cx)).
This is a classic universal instantiation → modus ponens → universal generalisation chain.
4. Validity Rules (Aristotle’s Five)
- Quality: If a premise is affirmative (A or I), the conclusion may be affirmative or negative.
- Quantity: If a premise is universal (A or E), the conclusion may be universal or particular.
- Figure: Which term is middle in which premise (first, second, third figure).
- Distribution: A term is distributed if it refers to all members of its class in a premise.
- A and E distribute the subject.
- E distributes the predicate.
- I and O distribute nothing.
- Existential Import: Universal statements may implicitly assert existence (e.g., “All unicorns are white” suggests unicorns exist). In modern logic, universals do not have existential import unless explicitly stated.
5. Edge Cases & Modern Extensions
| Edge Case | Explanation | Modern Treatment |
|---|---|---|
| Existential Fallacy | Concluding existence from a universal premise (e.g., “All unicorns are white” → “Some unicorns are white”). | Reject unless premise is existential (I or O). |
| Undistributed Middle | Middle term not distributed in either premise → invalid (e.g., “All cats are animals” & “All dogs are animals” → “All cats are dogs”). | Must distribute middle in at least one premise. |
| Mixed Quantities | Mixing universal and particular in a way that violates Aristotle’s rules (e.g., “Some cats are animals” & “All dogs are animals” → “Some cats are dogs”). | Often invalid; requires careful analysis of distribution. |
| Contraposition | Replacing terms with their complements (e.g., “All A are B” → “All non‑B are non‑A”). | Valid only for A and E, not for I/O. |
| Existential Import in Classical Logic | Classical syllogistic logic assumes existence; modern predicate logic removes this assumption. | Use explicit existential quantifiers when needed. |
6. Advanced Topics
6.1 Syllogistic Logic as a Fragment of First‑Order Logic
- The syllogistic fragment of FOL is decidable in linear time.
- It can be mapped to Horn clauses; each premise becomes a clause, and the conclusion is a derived clause.
6.2 Algebraic Representation
Using Venn diagrams or Euler diagrams:
- Each term is a set; intersection or complement operations correspond to logical relations.
- A syllogism is valid iff the shaded region implied by the premises contains the region implied by the conclusion.
6.3 Non‑Classical Syllogisms
- Modal syllogisms incorporate necessity/possibility (e.g., “It is necessary that all A are B”).
- Deontic syllogisms