The Review of Symbolic Logic

Table of Contents - 2008 - Volume 1, Issue 03  

Research Article

DECOMPOSING GENERALIZED QUANTIFIERS

DAG WESTERSTÅHLa1 c1

a1 Department of Philosophy, University of Gothenburg

Abstract

This note explains the circumstances under which a type xs30081xs3009 quantifier can be decomposed into a type xs30081, 1xs3009 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.

(Received May 29 2008)

Correspondence:

c1 DEPARTMENT OF PHILOSOPHY UNIVERSITY OF GOTHENBURG GOTHENBURG 405 30, SWEDEN E-mail: dag.westerstahl@phil.gu.se