The monadic theory of morphic infinite words and generalizations
Information and Computation
Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words
Structures in Logic and Computer Science, A Selection of Essays in Honor of Andrzej Ehrenfeucht
Decidable theories of the ordering of natural numbers with unary predicates
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
Decidable extensions of Church's problem
CSL'09/EACSL'09 Proceedings of the 23rd CSL international conference and 18th EACSL Annual conference on Computer science logic
Decidable expansions of labelled linear orderings
Fields of logic and computation
Regular sets over extended tree structures
Theoretical Computer Science
Interpretations in Trees with Countably Many Branches
LICS '12 Proceedings of the 2012 27th Annual IEEE/ACM Symposium on Logic in Computer Science
The Church problem for expansions of (N,
Information and Computation
| Hi-index | 0.00 |
A fundamental result of Buchi states that the set of monadic second-order formulas true in the structure (Nat, is decidable. The Elgot and Rabin automata theoretical method has been generalized and sharpened over the years and their results were extended to a variety of unary predicates. We give a sufficient and necessary model-theoretical condition for the decidability of the monadic theory of (Nat,