Hierarchies of monadic generalized quantifiers

Journal of Symbolic Logic 65 (3):1241-1263 (2000)
A combinatorial criterium is given when a monadic quantifier is expressible by means of universe-independent monadic quantifiers of width n. It is proved that the corresponding hierarchy does not collapse. As an application, it is shown that the second resumption (or vectorization) of the Hartig quantifier is not definable by monadic quantifiers. The techniques rely on Ramsey theory
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2586699
 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: 15,865
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

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

39 ( #84,088 of 1,724,892 )

Recent downloads (6 months)

28 ( #35,769 of 1,724,892 )

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.