Skip to main content
×
Home

DECOMPOSING GENERALIZED QUANTIFIERS

  • DAG WESTERSTÅHL (a1)
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.

Copyright
Corresponding author
*DEPARTMENT OF PHILOSOPHY UNIVERSITY OF GOTHENBURG GOTHENBURG 405 30, SWEDEN E-mail:dag.westerstahl@phil.gu.se
References
Hide All
Barker C. (1995). Possessive Descriptions. Stanford, CA: CSLI Publications.
Barwise J., & Cooper R. (1981). Generalized quantifiers and natural language. Linguistics and Philosophy, 4, 159219.
Dalrymple M., Kanazawa M., Kim Y., Mchombo S., & Peters S. (1998). Reciprocal expressions and the concept of reciprocity. Linguistics & Philosophy, 21, 159210.
Peters S., & Westerståhl D. (2006). Quantifiers in Language and Logic. Oxford, UK: Oxford University Press.
Peters S., & Westerståhl D. (in preparation). The semantics of possessive constructions.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Review of Symbolic Logic
  • ISSN: 1755-0203
  • EISSN: 1755-0211
  • URL: /core/journals/review-of-symbolic-logic
Please enter your name
Please enter a valid email address
Who would you like to send this to? *
×

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 12 *
Loading metrics...

Abstract views

Total abstract views: 125 *
Loading metrics...

* Views captured on Cambridge Core between September 2016 - 21st November 2017. This data will be updated every 24 hours.