En lógica formal, un cuantificador es una expresión que indica la cantidad de veces que un predicado o propiedad P se satisface dentro de una determinada clase (por ejemplo, pertenencia, equivalencia u orden). Existen muchos tipos de cuantificadores, entre los más utilizados están: \n* Cuantificador universal Para todo x, y... \n* Cuantificador existencial Existe al menos un x, y... \n* Cuantificador existencial único Existe exactamente un x, y... \n* Negación del cuantificador existencial No existe ningún x, y...

Leer el artículo completo en Wikipedia · CC-BY-SA

For example, in arithmetic, it allows the expression of the statement that every natural number has a successor. A language element which generates a quantification (such as "every") is called a quantifier. The resulting expression is a quantified expression, it is said to be quantified over the predicate (such as "the natural number x has a successor") whose free variable is bound by the quantifier. In formal languages, quantification is a formula constructor that produces new formulas from old ones. The semantics of the language specifies how the constructor is interpreted.Two fundamental kinds of quantification in predicate logic are universal quantification and existential quantification. The traditional symbol for the universal quantifier "all" is "∀", a rotated letter "A", and for the existential quantifier "exists" is "∃", a rotated letter "E". These quantifiers have been generalized beginning with the work of Mostowski and Lindström. Quantification is used as well in natural languages; examples of quantifiers in English are for all, for some, many, few, a lot, and no; see Quantifier (linguistics) for details.

Leer el artículo completo en Wikipedia · CC-BY-SA