Level Two of the Quantifier Alternation Hierarchy over Infinite Words
From MaRDI portal
Publication:5740188
DOI10.1007/978-3-319-34171-2_16zbMath1386.03043arXiv1509.06207MaRDI QIDQ5740188
Manfred Kufleitner, Tobias Walter
Publication date: 25 July 2016
Published in: Computer Science – Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1509.06207
03D05: Automata and formal grammars in connection with logical questions
03B25: Decidability of theories and sets of sentences
03C13: Model theory of finite structures
Related Items
Cites Work
- Fragments of first-order logic over infinite words
- Classifying regular events in symbolic logic
- The dot-depth hierarchy of star-free languages is infinite
- Level two of the quantifier alternation hierarchy over infinite words
- 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
- Decision problems forω-automata
- Testing and generating infinite sequences by a finite automaton
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
