Lindström quantifier
In mathematical logic, a Lindström quantifier is a generalized polyadic quantifier. Lindström quantifiers generalize first-order quantifiers, such as the existential quantifier, the universal quantifier, and the counting quantifiers. They were introduced by Per Lindström in 1966. They were later studied for their applications in logic in computer science and database query languages.
Wikipage redirect
Link from a Wikipage to another Wikipage
primaryTopic
Lindström quantifier
In mathematical logic, a Lindström quantifier is a generalized polyadic quantifier. Lindström quantifiers generalize first-order quantifiers, such as the existential quantifier, the universal quantifier, and the counting quantifiers. They were introduced by Per Lindström in 1966. They were later studied for their applications in logic in computer science and database query languages.
has abstract
In mathematical logic, a Linds ...... and database query languages.
@en
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
994,087,078
Link from a Wikipage to another Wikipage
date
October 2013
@en
reason
Should be the set of pairs of equal cardinality { : A,B ⊆ M and !A! = !B!} ?
@en
The 'a' on the left hand side of ⇔ should have an overline?
@en
The verb-phrase of the preceding sentence seems to be missing.
@en
wikiPageUsesTemplate
hypernym
comment
In mathematical logic, a Linds ...... and database query languages.
@en
label
Lindström quantifier
@en