Domain restriction and the arguments of quantificational determiners

Abstract
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)
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: 9,357
External links
  •   Try with proxy.
  • Through your library Only published papers are available at libraries
    References found in this work BETA

    No references found.

    Citations of this work BETA
    Similar books and articles
    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    22 ( #65,924 of 1,088,400 )

    Recent downloads (6 months)

    1 ( #69,601 of 1,088,400 )

    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.