The monadic second-order logic of graphs IX: machines and their behaviours
Selected papers of the workshop on Topology and completion in semantics
Monadic second-order logic on tree-like structures
Theoretical Computer Science
Decidability of Monadic Theories
Proceedings of the Mathematical Foundations of Computer Science 1984
The Monadic Theory of Morphic Infinite Words and Generalizations
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On Infinite Terms Having a Decidable Monadic Theory
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
The monadic theory of tree-like structures
Automata logics, and infinite games
A Contraction Method to Decide MSO Theories of Deterministic Trees
LICS '07 Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science
On the structure of graphs in the Caucal hierarchy
Theoretical Computer Science
Decidable theories of the ordering of natural numbers with unary predicates
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Decidable expansions of labelled linear orderings
Fields of logic and computation
| Hi-index | 0.00 |
We survey two basic techniques for showing that the monadic second-order theory of a structure is decidable. In the first approach, one deals with finite fragments of the theory (given for example by the restriction to formulas of a certain quantifier rank) and --- depending on the fragment --- reduces the model under consideration to a simpler one. In the second approach, one applies a global transformation of models while preserving decidability of the theory. We suggest a combination of these two methods.