Selection and uniformization problems in the monadic theory of ordinals: A survey

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4800 LNCS, Issue , 2008, Pages 571-588

  Rabinovich, Alexander ^a   Shomrat, Amit ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; SURVEYS; TECHNOLOGY;

MONADIC LOGIC; NATURAL GENERALIZATION; UNIFORMIZATION;

YTTRIUM ALLOYS;

EID: 49949085604     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-78127-1_31     Document Type: Conference Paper

References (24)

1. Büchi, J.R.: Weak second-order arithmetic and finite automata. Zeit. Math. Logik und Grundl. Math. 6, 66-92 (1960)
2. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: Proc. Int. Congress on Logic, Method, and Philosophy of Science. 1960, pp. 1-12. Stanford University Press (1962)
3. Büchi, J.R., Landweber, L.H.: Solving sequential conditions by finite-state strategies. Trans. Amer. Math. Soc. 138, 295-311 (1969)
4. Büchi, J.R., Siefkes, D.: The Monadic Second-Order Theory of all Countable Ordinals. In: Bloomfield, R.E., Jones, R.B., Marshall, L.S. (eds.) VDM 1988. LNCS, vol. 328, pp. 1-126. Springer, Heidelberg (1988)
5. Church, A.: Logic, arithmetic and automata. In: Proc. Inter. Cong. Math. 1963, Almquist and Wilksells, Uppsala (1963)
6. Elgot, C.: Decision problems of finite-automata design and related arithmetics. Trans. Amer. Math. Soc. 98, 21-51 (1961)
7. Feferman, S., Vaught, R.L.: The first-order properties of products of algebraic systems. Fundamenta Mathematicae 47, 57-103 (1959)
8. Gurevich, Y., Shelah, S.: Rabin's uniformization problem. Jou. of Symbolic Logic 48, 1105-1119 (1983)
9. Gurevich, Y.: Monadic second-order theories. In: Barwise, J., Feferman, S. (eds.) Model-Theoretic Logics, pp. 479-506. Springer, Heidelberg (1985)
10. Larson, P.B., Shelah, S.: The stationary set splitting game. Mathematical Logic Quarterly (to appear)
11. Lifsches, S., Shelah, S.: Uniformization and Skolem functions in the class of trees. Jou. of Symbolic Logic 63(1), 103-127 (1998)
12. McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Information and Control 9, 521-530 (1966)
13. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141, 1-35 (1969)
14. Rabin, M.O.: Automata on infinite objects and Church's problem. Amer. Math. Soc., Providence, RI (1972)
15. Rabinovich, A.: The Church synthesis problem over countable ordinals (submitted)
16. Rabinovich, A., Shomrat, A.: Selection in the monadic theory of a countable ordinal (submitted)
17. Rabinovich, A., Shomrat, A.: Selection over classes of ordinals expanded by monadic predicates (submitted)
18. Shelah, S.: The monadic theory of order. Annals of Math., Ser. 2 102, 379-419 (1975)
19. Shomrat, A.: Uniformization Problems in the Monadic Theory of Countable Ordinals. M.Sc. Thesis,Tel Aviv University (2007)
20. Trakhtenbrot, B.A.: The synthesis of logical nets whose operators are described in terms of one-place predicate calculus. Doklady Akad. Nauk SSSR 118(4), 646-649 (1958)
21. Trakhtenbrot, B.A.: Certain constructions in the logic of one-place predicates. Doklady Akad. Nauk SSSR 138, 320-321 (1961)
22. Trakhtenbrot, B.A.: Finite automata and monadic second order logic. Siberian Math. J 3, 101-131 (1962) Russian;
23. English translation in: AMS Transl. 59, 23-55 (1966)
24. Trakhtenbrot, B.A., Barzdin, Y.M.: Finite Automata. North Holland, Amsterdam (1973)