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

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. Buchi 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.

[1]  J. R. Büchi,et al.  Solving sequential conditions by finite-state strategies , 1969 .

[2]  Olivier Carton,et al.  The Monadic Theory of Morphic Infinite Words and Generalizations , 2000, Inf. Comput..

[3]  Alexander Moshe Rabinovich,et al.  On decidability of monadic logic of order over the naturals extended by monadic predicates , 2007, Inf. Comput..

[4]  Dirk Siefkes.  The recursive sets in certain monadic second order fragments of arithmetic , 1975, Arch. Math. Log..

[5]  Alonzo Church,et al.  Logic, arithmetic, and automata , 1962 .

[6]  R. Robinson.  Restricted set-theoretical definitions in arithmetic , 1958 .

[7]  Jean-Eric Pin,et al.  Infinite words - automata, semigroups, logic and games , 2004, Pure and applied mathematics series.

[8]  Michaël Rusinowitch,et al.  Relating two standard notions of secrecy , 2006, Log. Methods Comput. Sci..

[9]  S. Feferman,et al.  The first order properties of products of algebraic systems , 1959 .

[10]  Wolfgang Thomas,et al.  Ehrenfeucht Games, the Composition Method, and the Monadic Theory of Ordinal Words , 1997, Structures in Logic and Computer Science.

[11]  Alexander Moshe Rabinovich,et al.  Church Synthesis Problem with Parameters , 2006, CSL.

[12]  S. Shelah.  The monadic theory of order , 1975, 2305.00968.

[13]  Alexander Moshe Rabinovich,et al.  Decidable Extensions of Church's Problem , 2009, CSL.

[14]  R. McNaughton.  Review: J. Richard Buchi, Weak Second-Order Arithmetic and Finite Automata; J. Richard Buchi, On a Decision Method in Restricted second Order Arithmetic , 1963, Journal of Symbolic Logic.

[15]  Calvin C. Elgot,et al.  Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor , 1966, J. Symb. Log..

[16]  Alexander Moshe Rabinovich,et al.  Decidable Theories of the Ordering of Natural Numbers with Unary Predicates , 2006, CSL.

[17]  Thomas Wilke,et al.  Automata Logics, and Infinite Games , 2002, Lecture Notes in Computer Science.

[18]  A. L. Semënov.  LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS , 1984 .

[19]  Igor Walukiewicz,et al.  Pushdown Processes: Games and Model-Checking , 1996, Inf. Comput..

[20]  J. R. Büchi.  On a Decision Method in Restricted Second Order Arithmetic , 1990 .