Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable

DOI10.4230/LIPIcs.STACS.2013.305zbMath1354.03006arXiv1212.6500OpenAlexW2962965776MaRDI QIDQ2957893

Alexander Lauser, Manfred Kufleitner

Publication date: 30 January 2017

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

zbMATH Keywords

automata theorysemigroupsfirst-order logicregular languages

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Temporal logic (03B44) Subsystems of classical logic (including intuitionistic logic) (03B20)

Related Items (4)

The half-levels of the \(\mathrm {FO}_2\) alternation hierarchy ⋮ Alternation Hierarchies of First Order Logic with Regular Predicates ⋮ Locality and Centrality: The Variety ZG ⋮ Varieties

This page was built for publication: Quantifier Alternation in Two-Variable First-Order Logic with Successor Is Decidable