Quantifier rank

From testwiki
Jump to navigation Jump to search

Template:Short description Template:No footnotes In mathematical logic, the quantifier rank of a formula is the depth of nesting of its quantifiers. It plays an essential role in model theory.

The quantifier rank is a property of the formula itself (i.e. the expression in a language). Thus two logically equivalent formulae can have different quantifier ranks, when they express the same thing in different ways.

Definition

In first-order logic

Let φ be a first-order formula. The quantifier rank of φ, written qr⁡(φ), is defined as:

  • qr⁡(φ)=0, if φ is atomic.
  • qr⁡(φ1∧φ2)=qr⁡(φ1∨φ2)=max⁡(qr⁡(φ1),qr⁡(φ2)).
  • qr⁡(¬φ)=qr⁡(φ).
  • qr⁡(∃xφ)=qr⁡(φ)+1.
  • qr⁡(∀xφ)=qr⁡(φ)+1.

Remarks

  • We write FO⁡[n] for the set of all first-order formulas φ with qr⁡(φ)≤n.
  • Relational FO⁡[n] (without function symbols) is always of finite size, i.e. contains a finite number of formulas.
  • In prenex normal form, the quantifier rank of φ is exactly the number of quantifiers appearing in φ.

In higher-order logic

For fixed-point logic, with a least fixed-point operator LFP: qr⁡([LFPϕ]y)=1+qr⁡(ϕ).

Examples

  • A sentence of quantifier rank 2:
∀x∃yR(x,y)
  • A formula of quantifier rank 1:
∀xR(y,x)∧∃xR(x,y)
  • A formula of quantifier rank 0:
R(x,y)∧x≠y
∀x∃y∃z((x≠y∧xRy)∧(x≠z∧zRx))
  • A sentence, equivalent to the previous, although of quantifier rank 2:
∀x(∃y(x≠y∧xRy))∧∃z(x≠z∧zRx))

See also

References

Template:Reflist

Template:Mathematical logic