Shelah-Stupp's and Muchnik's iterations revisited
From MaRDI portal
Publication:2117107
Cites work
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Decision Problems of Finite Automata Design and Related Arithmetics
- Easy problems for tree-decomposable graphs
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Graph structure and monadic second-order logic. A language-theoretic approach
- scientific article; zbMATH DE number 3880651 (Why is no real title available?)
- scientific article; zbMATH DE number 177441 (Why is no real title available?)
- scientific article; zbMATH DE number 1929935 (Why is no real title available?)
- scientific article; zbMATH DE number 2087432 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- scientific article; zbMATH DE number 3337664 (Why is no real title available?)
- Monadic second-order logic on tree-like structures
- Monadic second-order logic, graph coverings and unfoldings of transition systems
- On infinite transition graphs having a decidable monadic theory
- Shelah-Stupp's iteration and Muchnik's iteration
- The monadic second-order logic of graphs, II: Infinite graphs of bounded width
- The monadic second-order logic of graphs. V: On closing the gap between definability and recognizability
- The monadic second-order logic of graphs. VII: Graphs as relational structures
- The monadic theory of order
- The theory of ends, pushdown automata, and second-order logic
This page was built for publication: Shelah-Stupp's and Muchnik's iterations revisited
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2117107)
