Model Transformations in Decidability Proofs for Monadic Theories
From MaRDI portal
Publication:3540168
DOI10.1007/978-3-540-87531-4_3zbMath1157.03004MaRDI QIDQ3540168
Publication date: 20 November 2008
Published in: Computer Science Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-87531-4_3
03B25: Decidability of theories and sets of sentences
Related Items
Cites Work
- The monadic second-order logic of graphs. IX: Machines and their behaviours
- On the structure of graphs in the Caucal hierarchy
- The monadic theory of order
- Monadic second-order logic, graph coverings and unfoldings of transition systems
- Monadic second-order logic on tree-like structures
- Automata, logics, and infinite games. A guide to current research
- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
- The Monadic Theory of Tree-like Structures
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item