The Church problem for expansions of (N, <) by unary predicates

Alexander Rabinovich*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review


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.

Original languageEnglish
Pages (from-to)1-16
Number of pages16
JournalInformation and Computation
StatePublished - Sep 2012


Dive into the research topics of 'The Church problem for expansions of (N, <) by unary predicates'. Together they form a unique fingerprint.

Cite this