The hierarchy theorem for generalized quantifiers
From MaRDI portal
Publication:5687317
DOI10.2307/2275786zbMath0864.03028MaRDI QIDQ5687317
Lauri Hella, Jouko Väänänen, Kerkko Luosto
Publication date: 15 June 1997
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275786
algorithm; first-order logic; generalized quantifier; procedure; ordered structures; finite structures; model class; monotone quantifier; definability of quantifiers; structures of a fixed similarity type
03C80: Logic with extra quantifiers and operators
03C13: Model theory of finite structures
03C30: Other model constructions
Related Items
Definability of second order generalized quantifiers, On second-order generalized quantifiers and finite structures, On the expressive power of monotone natural language quantifiers over finite models
Cites Work
- Vector spaces and binary quantifiers
- An optimal lower bound on the number of variables for graph identification
- The number of finite relational structures
- Definability hierarchies of generalized quantifiers
- Generalized quantifiers and pebble games on finite structures
- Generalized Quantifiers and Logical Reducibilities