Journal of Symbolic Logic
- J. Symbolic Logic
- Volume 61, Issue 3 (1996), 802-817.
The Hierarchy Theorem for Generalized Quantifiers
The concept of a generalized quantifier of a given similarity type was defined in . Our main result says that on finite structures different similarity types give rise to different classes of generalized quantifiers. More exactly, for every similarity type $t$ there is a generalized quantifier of type $t$ which is not definable in the extension of first order logic by all generalized quantifiers of type smaller than $t$. This was proved for unary similarity types by Per Lindstrom  with a counting argument. We extend his method to arbitrary similarity types.
J. Symbolic Logic, Volume 61, Issue 3 (1996), 802-817.
First available in Project Euclid: 6 July 2007
Permanent link to this document
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Hella, Lauri; Luosto, Kerkko; Vaananen, Jouko. The Hierarchy Theorem for Generalized Quantifiers. J. Symbolic Logic 61 (1996), no. 3, 802--817. https://projecteuclid.org/euclid.jsl/1183745078