Lakshadweep Patwari / Lekhpal /Reasoning Ability

Syllogism

Logical Reasoning · free study notes

Syllogism – Advanced Study Notes

(Target audience: University‑level students in logic, mathematics, philosophy, and computer science. The notes assume familiarity with propositional logic, first‑order logic, and basic set theory.)


1. Introduction

A syllogism is a deductive argument consisting of two premises and a conclusion, each of which is a categorical proposition. The classical form, introduced by Aristotle, is:

Premise 1 Premise 2 Conclusion
All A are B All C are A Therefore, all C are B

Modern treatments generalize this to arbitrary quantifiers and predicate symbols, but the core idea remains: a middle term links the subject of the conclusion to its predicate.


2. From First Principles

2.1 Categorical Propositions

A categorical proposition has the form:

  • Universal affirmative (A): All S are P → ∀x (S(x) → P(x))
  • Universal negative (E): No S are P → ∀x (S(x) → ¬P(x))
  • Particular affirmative (I): Some S are P → ∃x (S(x) ∧ P(x))
  • Particular negative (O): Some S are not P → ∃x (S(x) ∧ ¬P(x))

2.2 The Syllogistic Schema

A syllogism is a rule of inference of the form:

Premise 1:  [Quantifier]  [Term1]  [Relation]  [Term2]
Premise 2:  [Quantifier]  [Term3]  [Relation]  [Term1]
Conclusion: [Quantifier]  [Term3]  [Relation]  [Term2]

The middle term (Term1) appears in both premises but not in the conclusion.

2.3 Logical Derivation

We can represent the premises as:

  1. (P_1 : \forall x (S(x) \rightarrow M(x)))
  2. (P_2 : \forall x (T(x) \rightarrow S(x)))

We wish to derive:

(C : \forall x (T(x) \rightarrow M(x)))

Proof (syntactic):

  • Assume an arbitrary (t) such that (T(t)).
  • From (P_2), (T(t) \rightarrow S(t)). Apply modus ponens → (S(t)).
  • From (P_1), (S(t) \rightarrow M(t)). Apply modus ponens → (M(t)).
  • Thus, for arbitrary (t), (T(t) \rightarrow M(t)). Hence (C) holds.

This is the chain rule of inference.


3. Formal Logical Framework

3.1 First‑Order Logic (FOL) Encoding

Let the language have unary predicates (P, Q, R). A syllogism corresponds to a clause set:

  1. ∀x (P(x) → Q(x))
  2. ∀x (R(x) → P(x)) → ∀x (R(x) → Q(x))

The inference can be automated via resolution:

  • Rewrite as clauses:
    • ¬P(x) ∨ Q(x)
    • ¬R(x) ∨ P(x)
    • ¬R(x) ∨ Q(x) (goal)

Resolution:

  • Resolve ¬P(x) ∨ Q(x) with ¬R(x) ∨ P(x) → ¬R(x) ∨ Q(x).

Thus, the syllogism is derivable by a single resolution step.

3.2 Semantic Validity

A syllogism is valid if, in every structure where premises are true, the conclusion is true. For universal affirmative premises, this holds because the universal quantifier ensures the implication chain. For other moods (e.g., I–E, E–I), validity may fail; rigorous semantic checks involve constructing counter‑models.


4. Mood and Figure

Aristotle identified four figures (placement of the middle term) and ten moods (combinations of A, E, I, O). Modern treatments use reduced forms (e.g., Barbara, Celarent, Darii, Ferio).

  • Figure 1: Middle term as subject in both premises.
  • Figure 2: Middle term as predicate in premise 1, subject in premise 2.
  • Figure 3: Middle term as predicate in both premises.
  • Figure 4: Middle term as subject in premise 1, predicate in premise 2.

Validity Table (Classical)

Mood Premise 1 Premise 2 Conclusion Valid?
Barbara (A–A→A) A A A Yes
Celarent (E–A→E) E A E Yes
Darii (I–A→I) I A I Yes
Ferio (O–A→O) O A O Yes
... ... ... ... ...

Edge cases arise with particular premises. For instance, All A are B (A) and Some C are A (I) do not entail Some C are B (I) because the particular might refer to a different instance of A.


5. Edge Cases & Counterexamples

  1. Existential Import
    Classical logic treats All as purely universal, ignoring the need for existence. In logic with existential import, All assumes existence of the subject class. This changes validity: e.g., “All unicorns are white” (A) can be vacuously true if no unicorns exist; conclusions about existence may fail.

  2. Non‑Monotonicity
    Adding premises can invalidate a previously valid syllogism if the new premise introduces contradictions or negates earlier assumptions.

  3. Quantifier Scope
    In first‑order logic, the order of quantifiers matters. For example:

    • ∀x ∃y P(x, y)
    • ∃y ∀x P(x, y) These are not equivalent; a syllogism that implicitly assumes one order may be invalid if the other order applies.
  4. Partial Functions & Undefinedness
    In computational settings (e.g., programming language semantics), predicates may be undefined

Your note

Page 1

Doubt hai is topic me?

Free AI teacher se poocho — 24/7, step by step.