Hubbry Logo
Quantifier rankQuantifier rankMain
Open search
Quantifier rank
Community hub
Quantifier rank
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Quantifier rank
from Wikipedia

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

[edit]

In first-order logic

[edit]

Let be a first-order formula. The quantifier rank of , written , is defined as:

  • , if is atomic.
  • .
  • .
  • .
  • .

Remarks

  • We write for the set of all first-order formulas with .
  • Relational (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

[edit]

For fixed-point logic, with a least fixed-point operator : .

Examples

[edit]
  • A sentence of quantifier rank 2:
  • A formula of quantifier rank 1:
  • A formula of quantifier rank 0:
  • A sentence, equivalent to the previous, although of quantifier rank 2:

See also

[edit]

References

[edit]
[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia
Add your contribution
Related Hubs
User Avatar
No comments yet.