Model Transformations in Decidability Proofs for Monadic Theories
From MaRDI portal
Recommendations
Cites work
- Automata, logics, and infinite games. A guide to current research
- Decidability and undecidability of extensions of second (first) order theory of (generalized) successor
- Decidability of Second-Order Theories and Automata on Infinite Trees
- Decidable Theories of the Ordering of Natural Numbers with Unary Predicates
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
- scientific article; zbMATH DE number 3880651 (Why is no real title available?)
- scientific article; zbMATH DE number 1759414 (Why is no real title available?)
- scientific article; zbMATH DE number 1929935 (Why is no real title available?)
- scientific article; zbMATH DE number 3237829 (Why is no real title available?)
- Logical theories and compatible operations
- Monadic second-order logic on tree-like structures
- Monadic second-order logic, graph coverings and unfoldings of transition systems
- On the structure of graphs in the Caucal hierarchy
- The monadic second-order logic of graphs. IX: Machines and their behaviours
- The monadic theory of order
- The Monadic Theory of Tree-like Structures
Cited in
(3)
This page was built for publication: Model Transformations in Decidability Proofs for Monadic Theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3540168)