High Quality Content by WIKIPEDIA articles! In mathematical logic, a Lindstrom quantifier is a generalized polyadic quantifier. They are a generalization of first-order quantifiers, such as the existential quantifier, the universal quantifier, and the counting quantifiers.They were introduced by Per Lindstrom in 1966.Before we go on to Lindstrom's generalization, notice that any family of properties on dom(A) can be regarded as a monadic generalized quantifier. For example, the quantifier "there are exactly n things such that..." is a family of subsets of the domain a structure, each of which has a cardinality of size n. Then, "there are exactly 2 things such that ?" is true in A iff the set of things that are such that ? is a member of the set of all subsets of dom(A) of size 2.

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.