Generalized Quantifiers and Natural Language

Formal Semantics ◽

10.1002/9780470758335.ch3 ◽

2008 ◽

pp. 75-126 ◽

Cited By ~ 2

Author(s):

Jon Barwise ◽

Robin Cooper

Keyword(s):

Natural Language ◽

Generalized Quantifiers

Download Full-text

Embodied cognitive semantics for quantification

Belgian Journal of Linguistics ◽

10.1075/bjl.30.11pau ◽

2016 ◽

Vol 30 ◽

pp. 251-264

Author(s):

Simon Pauw ◽

Joseph Hilferty

Keyword(s):

Natural Language ◽

Noun Phrases ◽

Physical World ◽

Operational Semantic ◽

Cognitive Semantics ◽

Artificial Agents ◽

Generalized Quantifiers ◽

Semantic Model ◽

Model Based ◽

Quantified Noun Phrases

The present paper proposes an operational semantic model of natural language quantifiers (e.g., many, some, three) and their use in quantified noun phrases. To this end we use embodied artificial agents that communicate in and interact with the physical world. We argue that existing paradigms such as Generalized Quantifiers (Barwise and Cooper 1981; Montague 1973) and Fuzzy Quantifiers (Zadeh 1983) do not provide a satisfactory models for our situated-interaction scenarios and propose a more adequate semantic model, based on fuzzy-quantification.

Download Full-text

Natural language, sortal reducibility and generalized quantifiers

Journal of Symbolic Logic ◽

10.2307/2275339 ◽

1993 ◽

Vol 58 (1) ◽

pp. 314-325 ◽

Cited By ~ 24

Author(s):

Edward L. Keenan

Keyword(s):

Natural Language ◽

Recent Work ◽

Strong Form ◽

Generalized Quantifiers ◽

Natural Language Semantics ◽

Language Semantics

AbstractRecent work in natural language semantics leads to some new observations on generalized quantifiers. In §1 we show that English quantifiers of type 〈1, 1〉 are booleanly generated by theirgeneralized universalandgeneralized existentialmembers. These two classes also constitute thesortally reduciblemembers of this type.Section 2 presents our main result — the Generalized Prefix Theorem (GPT). This theorem characterizes the conditions under which formulas of the form (Q1x1…QnxnRx1…xnandq1x1…qnxnRx1…xnare logically equivalent for arbitrary generalized quantifiersQi,qi. GPT generalizes, perhaps in an unexpectedly strong form, the Linear Prefix Theorem (appropriately modified) of Keisler & Walkoe (1973).

Download Full-text