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: and . These quantifiers bind the set variable x and contain a term t which may not mention x but which may have other free variables.
The semantics of these quantifiers is determined by the following rules:
A ZF formula which contains only bounded quantifiers is called, and . This forms the basis of the Levy hierarchy, which is defined analogously with the arithmetical hierarchy.
Bounded quantifiers are important in Kripke-Platek set theory and constructive set theory, where only Δ0 separation is included. That is, it includes separation for formulas with only bounded quantifiers, but not separation for other formulas. In KP the motivation is the fact that whether a set x satisfies a bounded quantifier formula only depends on the collection of sets that are close in rank to x (as the powerset operation can only be applied finitely many times to form a term). In constructive set theory, it is motivated on predicative grounds.
Read more about this topic: Bounded Quantifier
Famous quotes containing the words bounded, set and/or theory:
“Me, what’s that after all? An arbitrary limitation of being bounded by the people before and after and on either side. Where they leave off, I begin, and vice versa.”
—Russell Hoban (b. 1925)
“If nations always moved from one set of furnished rooms to another—and always into a better set—things might be easier, but the trouble is that there is no one to prepare the new rooms. The future is worse than the ocean—there is nothing there. It will be what men and circumstances make it.”
—Alexander Herzen (1812–1870)
“The things that will destroy America are prosperity-at-any- price, peace-at-any-price, safety-first instead of duty-first, the love of soft living, and the get-rich-quick theory of life.”
—Theodore Roosevelt (1858–1919)