On the expressive power of monotone natural language quantifiers over finite models
From MaRDI portal
Publication:1857361
DOI10.1023/A:1019934611163zbMath1014.03034MaRDI QIDQ1857361
Jouko Väänänen, Dag Westerståhl
Publication date: 22 July 2003
Published in: Journal of Philosophical Logic (Search for Journal in Brave)
natural language semantics; definability; natural language quantification; finite model; monotone quantifier; monotone generalized quantifiers; smooth quantifiers
03B65: Logic of natural languages
03C80: Logic with extra quantifiers and operators
03C13: Model theory of finite structures
Related Items
Scope dominance with monotone quantifiers over finite domains, Invariance Properties of Quantifiers and Multiagent Information Exchange, Identification through Inductive Verification
Cites Work
- Essays in logical semantics
- Unary quantifiers on finite models
- Generalized quantifiers and pebble games on finite structures
- Questions about quantifiers
- A semantic characterization of natural language determiners
- Generalized quantifiers and natural language
- The hierarchy theorem for generalized quantifiers
- Unnamed Item
- Unnamed Item
- Unnamed Item