DECOMPOSING GENERALIZED QUANTIFIERS

被引：3
|
作者：
Westerstahl, Dag [1 ]
机构：
[1] Univ Gothenburg, Dept Philosophy, S-40530 Gothenburg, Sweden
来源：
REVIEW OF SYMBOLIC LOGIC | 2008年 / 1卷 / 03期
关键词：
D O I：
10.1017/S1755020308080234
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
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.
引用
收藏
页码：355 / 371
页数：17
相关论文
共 50 条
12345