On the expressive power of monotone natural language quantifiers over finite models

DOI10.1023/A:1019934611163zbMath1014.03034MaRDI QIDQ1857361

Dag Westerståhl, Jouko Väänänen

Publication date: 22 July 2003

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

zbMATH Keywords

natural language semanticsdefinabilitynatural language quantificationfinite modelmonotone quantifiermonotone generalized quantifierssmooth quantifiers

Mathematics Subject Classification ID

Logic of natural languages (03B65) Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13)

Related Items (4)

Invariance Properties of Quantifiers and Multiagent Information Exchange ⋮ Scope dominance with monotone quantifiers over finite domains ⋮ Identification through Inductive Verification ⋮ Sameness

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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

This page was built for publication: On the expressive power of monotone natural language quantifiers over finite models