• Home
  • Decomposing generalized quantifiers

Decomposing generalized quantifiers

Sourcetitle: 
The Review of Symbolic Logic
Year of publication: 
2008
PublicationType: 
Scientific journal article - peer reviewed

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.

http://dx.doi.org/ 10.1017/S1755020308080234

Sourcepages: 
355-371
To the top

Page updated: 2012-01-30 14:02

Send as email
Print page
Show as pdf

X
Loading