Namespaces
Variants
Actions

Restricted quantifier

From Encyclopedia of Mathematics
Revision as of 17:26, 7 February 2011 by 127.0.0.1 (talk) (Importing text file)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

A quantifier applied to predicates not with respect to the whole range of a given object variable, but with respect to a part of it defined by a predicate . When used in this restricted sense, the universal quantifier and the existential quantifier are usually denoted by and (or and , respectively). If is a predicate, then means

that is, the predicate is true for all values of the variable satisfying the predicate . The proposition means

that is, the intersection of the truth domains of the predicates and is non-empty.

Restricted quantifiers of the form and (more commonly called bounded quantifiers) play an important role in formal arithmetic (cf. Arithmetic, formal), where is a term not containing . When these quantifiers are applied to a decidable predicate, the result is a decidable predicate.

How to Cite This Entry:
Restricted quantifier. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Restricted_quantifier&oldid=33093
This article was adapted from an original article by V.E. Plisko (originator), which appeared in Encyclopedia of Mathematics - ISBN 1402006098. See original article