On logical hierarchies within FO^2-definable languages

DOI10.2168/LMCS-8(3:11)2012zbMath1256.03043arXiv1208.0713MaRDI QIDQ2904628

Manfred Kufleitner, Pascal Weil

Publication date: 15 August 2012

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1208.0713

zbMATH Keywords

alternation hierarchytwo-variable fragment of first-order logicrankers

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70) Decidability of theories and sets of sentences (03B25) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (6)

The word problem for omega-terms over the Trotter-Weil hierarchy ⋮ Conelikes and ranker comparisons ⋮ How many times do you need to go back to the future in unary temporal logic? ⋮ The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy ⋮ Varieties ⋮ One quantifier alternation in first-order logic with modular predicates

This page was built for publication: On logical hierarchies within FO^2-definable languages