Decomposing generalized quantifiers
| Authors |
|
|---|---|
| Publication date | 2008 |
| Journal | Review of Symbolic Logic |
| Volume | Issue number | 1 | 3 |
| Pages (from-to) | 355-371 |
| Organisations |
|
| Abstract | This note explains the circumstances under which a type <1> quantifier can be decomposed into a type <1, 1> quantifier and a set, by fixing the first argument of the former to the latter. The motivation comes from the semantics of Noun Phrases (also called Determiner Phrases) in natural languages, but in this article, I focus on the logical facts. However, my examples are taken among quantifiers appearing in natural languages, and at the end, I sketch two more principled linguistic applications. |
| Document type | Article |
| Published at |
https://doi.org/10.1017/S1755020308080234
(Final published version)
|
| Downloads | |
| Permalink to this page | |