Level two of the quantifier alternation hierarchy over infinite words

DOI10.1007/S00224-017-9801-XMaRDI QIDQ1635804zbMATH OpenOpenAlexFDO

Authors 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

finite model theoryautomata theoryfirst-order logicsemigroupsinfinite wordsregular languages

Mathematics Subject Classification ID

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

Recommendations

• Level Two of the Quantifier Alternation Hierarchy over Infinite Words
• Quantifier alternation for infinite words
• Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
• First-order fragments with successor over infinite words
• Going Higher in First-Order Quantifier Alternation Hierarchies on Words

Cites work

• scientific article; zbMATH DE number 3471986 (Why is no real title available?)
• scientific article; zbMATH DE number 3561239 (Why is no real title available?)
• scientific article; zbMATH DE number 512866 (Why is no real title available?)
• scientific article; zbMATH DE number 618821 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 2206109 (Why is no real title available?)
• A SURVEY ON SMALL FRAGMENTS OF FIRST-ORDER LOGIC OVER FINITE WORDS
• Classifying regular events in symbolic logic
• Finite semigroup varieties of the form V*D
• First-order fragments with successor over infinite words
• Fragments of first-order logic over infinite words
• Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
• Level Two of the Quantifier Alternation Hierarchy over Infinite Words
• One quantifier alternation in first-order logic with modular predicates
• Quantifier alternation for infinite words
• The dot-depth hierarchy of star-free languages is infinite
• Topologies refining the Cantor topology on \(X^\omega\)

Cited in

(11)

• Deciding \(\mathrm{FO}^2\) alternation for automata over finite and infinite words
• Fragments of first-order logic over infinite words
• Level Two of the Quantifier Alternation Hierarchy over Infinite Words
• The decision problem for some logics for finite words on infinite alphabets
• scientific article; zbMATH DE number 1775408 (Why is no real title available?)
• First-order fragments with successor over infinite words
• Forbidden Patterns for FO² Alternation Over Finite and Infinite Words
• Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
• scientific article; zbMATH DE number 408810 (Why is no real title available?)
• Going Higher in First-Order Quantifier Alternation Hierarchies on Words
• Quantifier alternation for infinite words

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1635804)