The church synthesis problem with parameters

Logical Methods in Computer Science

Volumn 3, Issue 4, 2007, Pages

  Rabinovich, Alexander ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Decidability; Monadic logic; Synthesis problem

Indexed keywords

COMPUTABILITY AND DECIDABILITY; COMPUTER CIRCUITS;

DEFINABILITY; MONADIC LOGIC; PARAMETERIZED; SYNTHESIS PROBLEMS;

RELIGIOUS BUILDINGS;

EID: 70350362155     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-3(4:9)2007     Document Type: Article

References (32)

1. J. R. Büchi. On a decision method in restricted second order arithmetic In Proc. International Congress on Logic, Methodology and Philosophy of Science, E. Nagel at al. eds, Stanford University Press, pp 1-11, 1960.
2. J. R. Büchi and L. H. Landweber. Solving sequential conditions by finitestate strategies. Transactions of the AMS, 138(27):295-311, 1969.
3. J. R. Büchi, D. Siefkes, The Monadic Second-order Theory of all Countable Ordinals, Springer Lecture Notes 328 (1973), pp. 1-126.
4. O. Carton and W. Thomas. The Monadic Theory of Morphic Infinite Words and Generalizations. Inf. Comput. 176(1), pp. 51-65, 2002.
5. Y. Choueka. Finite Automata on Infinite Structure. Ph.D Thesis, Hebrew University, 1970.
6. C. Elgot and M. O. Rabin. Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor. J. Symb. Log., 31(2), pp. 169-181, 1966.
7. E. A. Emerson, C. S. Jutla: Tree Automata, Mu-Calculus and Determinacy (Extended Abstract) FOCS91: 368-377, 1991.
8. E. Grädel, W. Thomas and T. Wilke. Automata, Logics, and Infinite Games, LNCS 2500, 2002.
9. Y. Gurevich and S. Shelah. Rabin’s uniformization problem. The Journal of Symbolic Logic, 48:1105-1119, 1983.
10. O. Kupferman and M.Y. Vardi, Synthesis with incomplete information, In 2nd International Conference on Temporal Logic, pp 91-106, 1997.
11. R. McNaughton, Testing and generating infinite sequences by a finite automaton, Information and Control 9 (1966), pp. 521-530.
12. S. Lifsches, S. Shelah, Uniformization and skolem functions in the class of trees, Jou. Of Symolic Logic, Vol. 63(1) (Mar. 1998), pp. 103-127.
13. D. Perrin and J. E. Pin. Infinite Words Automata, Semigroups, Logic and Games. Pure and Applied Mathematics Vol 141 Elsevier, 2004.
14. M. O. Rabin. Automata on Infinite Objects and Church’s Problem Amer. Math. Soc. Providence, RI, 1972.
15. A. Rabinovich. On decidability of monadic logic of order over the naturals extended by monadic predicates. 2005 Summer Meeting of the Association for Symbolic Logic, Logic Colloquium 05. The Bulletin of Symbolic Logic 12:343-344, 2006.
16. A. Rabinovich. The Church problem over ω expanded by factorial numbers. In preparation, 2006.
17. A. Rabinovich. The Church Problem for Countable Ordinals. Submitted, 2006.
18. A. Rabinovich. On decidability of Monadic logic of order over the naturals extended by monadic predicates. Information and Computation, 2007.
19. A. Rabinovich and B.A. Trakhtenbrot. From Finite Automata toward Hybrid Systems Proceddings of Fundamentals of Computation Theory. Lecture Notes in Computer Science 1450, pp. 411-422, Springer, 1998.
20. A. Rabinovich and A. Shomrat. Selection in the Monadic Theory of Countable Ordinals. Submitted 2006.
21. A. Rabinovich and W. Thomas. Decidable Theories of the Ordering of Natural Numbers with Unary Predicates. In CSL 2006, Springer LNCS 4207, 562-574, 2006.
22. A. Rabinovich and W. Thomas. Logical Refinements of Church’s Problem. In CSL 2007, LNCS 4646, 69-83, 2007.
23. R. M. Robinson. Restricted Set-Theoretical Definitions in Arithmetic. In Proceedings of the AMS Vol. 9, No. 2. pp. 238-242, 1958.
24. A. Semenov. Logical theories of one-place functions on the set of natural numbers. Mathematics of the USSR-Izvestia, vol. 22, pp 587-618, 1984.
25. O. Serre. Games With Winning Conditions of High Borel Complexity. In ICALP 2004, LNCS volume 3142, pp. 1150-1162, 2004.
26. S. Shelah. The monadic theory of order. Ann. of Math. 102:379-419, 1975.
27. D. Siefkes. The recursive sets in certain monadic second order fragments of arithmetic. Arch. Math. Logik, pp71-80, 17(1975).
28. W. Thomas. Das Entscheidungsproblem für einige Erweiterungen der Nachfalger-Arithmetic. Ph. D. Thesis Albert-Ludwigs Universität, 1975.
29. W. Thomas. On the synthesis of strategies in infinite games. In STACS ’95, LNCS vo. 900, pp. 1-13. 1995.
30. W. Thomas. Constructing infinite graphs with a decidable MSO-theory. In MFCS03, LNCS 2747, 2003.
31. B. A. Trakhtenbrot. Finite automata and the logic of one-place predicates. (Russian version 1961). In AMS Transl. 59, 1966, pp. 23-55.
32. I. Walukiewicz. Monadic second order logic on tree-like structures.TCS 1:275, pp 311-346, 2002.