The hierarchy theorem for generalized quantifiers

Journal of Symbolic Logic 61 (3):802-817 (1996)
The concept of a generalized quantifier of a given similarity type was defined in [12]. 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 Lindström [17] with a counting argument. We extend his method to arbitrary similarity types
Keywords generalized quantifier   finite model theory   abstact model theory
Categories (categorize this paper)
DOI 10.2307/2275786
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
Download options
PhilPapers Archive

Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 23,217
External links
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
References found in this work BETA
Lauri Hella (1989). Definability Hierarchies of Generalized Quantifiers. Annals of Pure and Applied Logic 43 (3):235-271.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

204 ( #17,298 of 1,932,454 )

Recent downloads (6 months)

1 ( #456,114 of 1,932,454 )

How can I increase my downloads?

My notes
Sign in to use this feature

Start a new thread
There  are no threads in this forum
Nothing in this forum yet.