Decomposing generalized quantifiers

Review of Symbolic Logic 1 (3):355-371 (2008)
  Copy   BIBTEX

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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Analytics

Added to PP
2009-01-28

Downloads
68 (#234,507)

6 months
14 (#170,850)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Dag Westerståhl
Stockholm University

Citations of this work

The semantics of exceptives.Stanley Peters & Dag Westerståhl - 2023 - Linguistics and Philosophy 46 (2):197-235.

Add more citations

References found in this work

Generalized quantifiers and natural language.John Barwise & Robin Cooper - 1981 - Linguistics and Philosophy 4 (2):159--219.
Generalized Quantifiers and Natural Language.Jon Barwise - 1980 - Linguistics and Philosophy 4:159.
Quantifiers in Language and Logic.Stanley Peters & Dag Westerståhl - 2006 - Oxford, England: Clarendon Press.
Quantifiers in Language and Logic.Stanley Peters & Dag Westerståhl - 2006 - Oxford, England: Oxford University Press UK.

Add more references