Hostname: page-component-745bb68f8f-l4dxg Total loading time: 0 Render date: 2025-02-10T23:53:28.840Z Has data issue: false hasContentIssue false

DECOMPOSING GENERALIZED QUANTIFIERS

Published online by Cambridge University Press:  01 October 2008

DAG WESTERSTÅHL*
Affiliation:
Department of Philosophy, University of Gothenburg
*
*DEPARTMENT OF PHILOSOPHY UNIVERSITY OF GOTHENBURG GOTHENBURG 405 30, SWEDEN E-mail:dag.westerstahl@phil.gu.se
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2008

References

BIBLIOGRAPHY

Barker, C. (1995). Possessive Descriptions. Stanford, CA: CSLI Publications.Google Scholar
Barwise, J., & Cooper, R. (1981). Generalized quantifiers and natural language. Linguistics and Philosophy, 4, 159219.CrossRefGoogle Scholar
Dalrymple, M., Kanazawa, M., Kim, Y., Mchombo, S., & Peters, S. (1998). Reciprocal expressions and the concept of reciprocity. Linguistics & Philosophy, 21, 159210.CrossRefGoogle Scholar
Peters, S., & Westerståhl, D. (2006). Quantifiers in Language and Logic. Oxford, UK: Oxford University Press.Google Scholar
Peters, S., & Westerståhl, D. (in preparation). The semantics of possessive constructions.Google Scholar