Natural language, sortal reducibility and generalized quantifiers

DOI10.2307/2275339zbMath0783.03011OpenAlexW2057135913MaRDI QIDQ5287694

Edward L. Keenan

Publication date: 17 August 1993

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2275339

zbMATH Keywords

natural language semanticsgeneralized quantifiersEnglish quantifiersGeneralized Prefix Theorem

Mathematics Subject Classification ID

Logic of natural languages (03B65)

Related Items (7)

Anaphoric conservativity ⋮ Directions in generalized quantifier theory ⋮ On the Logical Expressive Power of Natural Languages ⋮ Quantification in English is Inherently Sortal ⋮ Some properties of intercategorial entailment ⋮ Scope dominance with upward monotone quantifiers ⋮ Symmetric and contrapositional quantifiers

Cites Work

• Some results on quantifiers
• Essays in logical semantics
• A semantic characterization of natural language determiners
• Generalized quantifiers and natural language
• A generalized quantifier logic for naked infinitives
• Polyadic quantifiers
• The diversity of quantifier prefixes

This page was built for publication: Natural language, sortal reducibility and generalized quantifiers