Definability of polyadic lifts of generalized quantifiers

Abstract
We study generalized quantifiers on finite structures.With every function : we associate a quantifier Q by letting Q x say there are at least (n) elementsx satisfying , where n is the sizeof the universe. This is the general form ofwhat is known as a monotone quantifier of type .We study so called polyadic liftsof such quantifiers. The particular lifts we considerare Ramseyfication, branching and resumption.In each case we get exact criteria fordefinability of the lift in terms of simpler quantifiers.
Keywords definability   generalized   quantifiers
Categories (categorize this paper)
DOI 10.1023/A:1008215718090
Options
 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: 20,898
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
Juha Kontinen & Jakub Szymanik (2008). A Remark on Collective Quantification. Journal of Logic, Language and Information 17 (2):131-140.

Add more citations

Similar books and articles

Monthly downloads

Added to index

2009-01-28

Total downloads

22 ( #173,026 of 1,907,512 )

Recent downloads (6 months)

4 ( #197,471 of 1,907,512 )

How can I increase my downloads?

My notes
Sign in to use this feature


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