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
Automata logics, and infinite games: a guide to current research
Automata logics, and infinite games: a guide to current research
On decidability of monadic logic of order over the naturals extended by monadic predicates
Information and Computation
Decidable theories of the ordering of natural numbers with unary predicates
CSL'06 Proceedings of the 20th international conference on Computer Science Logic
The Church problem for expansions of (N,
Information and Computation
| Hi-index | 0.00 |
For a two-variable formula B(X,Y) of Monadic Logic of Order (MLO) the Church Synthesis Problem concerns the existence and construction of a finite-state operator Y=F(X) such that B(X, F(X)) is universally valid over Nat. Büchi and Landweber (1969) proved that the Church synthesis problem is decidable. We investigate a parameterized version of the Church synthesis problem. In this extended version a formula B and a finite-state operator F might contain as a parameter a unary predicate P. A large class of predicates P is exhibited such that the Church problem with the parameter P is decidable. Our proofs use Composition Method and game theoretical techniques.