Domain restriction and the arguments of quantificational determiners

Classical generalized quantifier (GQ) theory posits that quantificational determiners (Q-dets) combine with a nominal argument of type et, a first order predicate, to form a GQ. In a recent paper, Matthewson (2001) challenges this position by arguing that the domain of a Q-det is not of type et, but e, an entity. In this paper, I defend the classical GQ view, and argue that the data that motivated Matthewson’s revision actually suggest that the domain set can, and indeed in certain languages must, be contextually restricted overtly.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
 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
Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 26,769
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
Modal Indefinites.Luis Alonso-Ovalle & Paula Menéndez-Benito - 2010 - Natural Language Semantics 18 (1):1-31.

Add more citations

Similar books and articles

Monthly downloads

Added to index


Total downloads

39 ( #130,914 of 2,158,890 )

Recent downloads (6 months)

2 ( #193,038 of 2,158,890 )

How can I increase my downloads?

My notes
Sign in to use this feature

There  are no threads in this forum
Nothing in this forum yet.

Other forums