Quantification Definition and 16 Threads

In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula. For instance, the universal quantifier



∀


{\displaystyle \forall }
in the first order formula



∀
x
P
(
x
)


{\displaystyle \forall xP(x)}
expresses that everything in the domain satisfies the property denoted by



P


{\displaystyle P}
. On the other hand, the existential quantifier



∃


{\displaystyle \exists }
in the formula



∃
x
P
(
x
)


{\displaystyle \exists xP(x)}
expresses that there is something in the domain which satisfies that property. A formula where a quantifier takes widest scope is called a quantified formula. A quantified formula must contain a bound variable and a subformula specifying a property of the referent of that variable.
The mostly commonly used quantifiers are



∀


{\displaystyle \forall }
and



∃


{\displaystyle \exists }
. These quantifiers are standardly defined as duals and are thus interdefinable using negation. They can also be used to define more complex quantifiers, as in the formula



¬
∃
x
P
(
x
)


{\displaystyle \neg \exists xP(x)}
which expresses that nothing has the property



P


{\displaystyle P}
. Other quantifiers are only definable within second order logic or higher order logics. Quantifiers have been generalized beginning with the work of Mostowski and Lindström.
First order quantifiers approximate the meanings of some natural language quantifiers such as "some" and "all". However, many natural language quantifiers can only be analyzed in terms of generalized quantifiers.

View More On Wikipedia.org