Descriptive complexity of finite structures: Saving the quantifier rank
From MaRDI portal
Publication:5718668
DOI 10.2178/jsl/1120224721</link>zbMath 1105.03029</link>arXiv math/0305244</link>OpenAlex W2025099804</link>MaRDI QID Q5718668</link>
Publication date: 16 January 2006
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0305244
Model theory of finite structures (03C13) Quantifier elimination, model completeness, and related topics (03C10) Descriptive complexity and finite models (68Q19)
Related Items (4)
Succinct definitions in the first order theory of graphs ⋮ The first order definability of graphs: Upper bounds for quantifier depth ⋮ Decomposable graphs and definitions with no quantifier alternation ⋮ Defining long words succinctly in FO and MSO
Cites Work
This page was built for publication: Descriptive complexity of finite structures: Saving the quantifier rank