Level two of the quantifier alternation hierarchy over infinite words

DOI10.1007/s00224-017-9801-xzbMath1436.03216OpenAlexW2743761496MaRDI QIDQ1635804

Manfred Kufleitner, Tobias Walter

Publication date: 1 June 2018

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://dspace.lboro.ac.uk/2134/31947

zbMATH Keywords

automata theorysemigroupsfirst-order logicregular languagesinfinite wordsfinite model theory

Mathematics Subject Classification ID

Automata and formal grammars in connection with logical questions (03D05) Decidability of theories and sets of sentences (03B25) Model theory of finite structures (03C13)

Related Items (3)

Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words ⋮ Forbidden Patterns for FO² Alternation Over Finite and Infinite Words ⋮ Level Two of the Quantifier Alternation Hierarchy over Infinite Words

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fragments of first-order logic over infinite words
• Classifying regular events in symbolic logic
• The dot-depth hierarchy of star-free languages is infinite
• Finite semigroup varieties of the form V*D
• Quantifier Alternation for Infinite Words
• Topologies Refining the Cantor Topology on X ω
• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
• Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
• One quantifier alternation in first-order logic with modular predicates
• Level Two of the Quantifier Alternation Hierarchy over Infinite Words

This page was built for publication: Level two of the quantifier alternation hierarchy over infinite words