The Quantifier Alternation Hierarchy of Synchronous Relations
From MaRDI portal
Publication:5092389
DOI10.4230/LIPICS.MFCS.2019.29OpenAlexW2958258072MaRDI QIDQ5092389FDOQ5092389
Authors: Diego Figueira, Varun Ramanathan, Pascal Weil 
Publication date: 21 July 2022
Full work available at URL: https://hal.science/hal-02109188
Recommendations
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- Going Higher in First-Order Quantifier Alternation Hierarchies on Words
- Quantifier alternation for infinite words
- scientific article; zbMATH DE number 408810
- Quantifier alternation in two-variable first-order logic with successor is decidable
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On finite monoids having only trivial subgroups
- Title not available (Why is that?)
- Title not available (Why is that?)
- Polynomial closure and unambiguous product
- Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
- Ordering by Divisibility in Abstract Algebras
- Title not available (Why is that?)
- Title not available (Why is that?)
- CONCUR 2004 - Concurrency Theory
- Definable relations and first-order query languages over strings
- Sets recognized by n-tape automata
- Concatenation hierarchies: new bottle, old wine
- Title not available (Why is that?)
- An introduction to finite automata and their connection to logic
Cited In (3)
This page was built for publication: The Quantifier Alternation Hierarchy of Synchronous Relations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092389)
