Hostname: page-component-7b7567c8c-mnklg Total loading time: 0 Render date: 2026-11-12T06:20:17.538Z 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.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2008