Lably
Skip to content

Universal generalization

Rule of inference in predicate logic

  • 1 min read
  • 2 chapters

Related on Lably

Through Rule of inference

Generalization with hypotheses

The full generalization rule allows for hypotheses to the left of the turnstile, but with restrictions. Assume Γ is a set of formulas, φ a formula, and Γ⊢φ(y) has been derived. The generalization rule states that Γ⊢∀xφ(x) can be derived if y is not mentioned in Γ and x does not occur in φ.

These restrictions are necessary for soundness. Without the first restriction, one could conclude ∀xP(x) from the hypothesis P(y). Without the second restriction, one could make the following deduction:

  1. ∃z∃w(z≠w) (Hypothesis)
  2. ∃w(y≠w) (Existential instantiation)
  3. y≠x (Existential instantiation)
  4. ∀x(x≠x) (Faulty universal generalization)

This purports to show that ∃z∃w(z≠w)⊢∀x(x≠x), which is an unsound deduction. Note that Γ⊢∀yφ(y) is permissible if y is not mentioned in Γ (the second restriction need not apply, as the semantic structure of φ(y) is not being changed by the substitution of any variables).

Sign in to keep reading

One more chapter is free with a Lably account.

More in Foundations