In the arithmetical hierarchy, an arithmetical formula that contains only bounded quantifiers is called , , and . The superscript 0 is sometimes omitted.

Bounded quantifiers in set theory

Suppose that L is the language of the Zermelo-Fraenkel set theory, where the ellipsis may be replaced by term-forming operations such as a symbol for the powerset operation. There are two bounded quantifiers:

1.Previous
3.Next