formulas):
:
:

There are several motivations for these quantifiers.
* In applications of the language to computability theory, such as the arithmetical hierarchy, bounded quantifiers add no complexity. If is a decidable predicate then and are decidable as well.
* In applications to the study of Peano arithmetic, the fact that a