The hierarchy theorem for generalized quantifiers

DOI10.2307/2275786zbMath0864.03028OpenAlexW2159337272MaRDI QIDQ5687317

Kerkko Luosto, Jouko Väänänen, Lauri Hella

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

zbMATH Keywords

algorithmfirst-order logicgeneralized quantifierprocedureordered structuresfinite structuresmodel classmonotone quantifierdefinability of quantifiersstructures of a fixed similarity type

Mathematics Subject Classification ID

Logic with extra quantifiers and operators (03C80) Model theory of finite structures (03C13) Other model constructions (03C30)

Related Items (6)

On second-order generalized quantifiers and finite structures ⋮ A note on the Kolmogorov data complexity and nonuniform logical definitions ⋮ Definability of second order generalized quantifiers ⋮ A framework for comparing query languages in their ability to express Boolean queries ⋮ Completeness and interpolation of almost-everywhere quantification over finitely additive measures ⋮ 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

This page was built for publication: The hierarchy theorem for generalized quantifiers