z-logo
open-access-imgOpen Access
Two types of most
Author(s) -
Carmen DobrovieSorin
Publication year - 2015
Publication title -
proceedings from semantics and linguistic theory
Language(s) - English
Resource type - Journals
eISSN - 2163-5951
pISSN - 2163-5943
DOI - 10.3765/salt.v25i0.3484
Subject(s) - plural , predicate (mathematical logic) , mereology , computer science , natural language processing , linguistics , mathematics , scope (computer science) , set (abstract data type) , artificial intelligence , programming language , philosophy , epistemology
The empirical puzzle to be solved is the contrast between partitive and non-partitive most (which respectively take of-DP and NP restrictors, respectively) wrt their compatibility with a collective predicate (or a collectively interpreted mixed predicate) in the nuclear scope. The proposal will rely on the ‘null hypothesis’ regarding the correspondence between syntactic categories and semantic type: DPs and NPs respectively denote entities and sets of entities. Our puzzle will be solved by explaining why set-restrictor quantifiers cannot denote relations between sets of plural entities whereas entity-restrictor quantifiers can denote relations between plural entities. It will also be argued that plural bare NPs in the restrictor of most can be kind-denoting (in addition to being set-denoting) in English. Throughout the paper the main generalizations will be strengthened or refined by taking into account the Romanian counterparts of the relevant dat. Keywords: collective quantification, mass quantification, bare mass NPs, bare plurals, kind-reference

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom