On decidability of monadic logic of order over the naturals extended by monadic predicates

Information and Computation

Volumn 205, Issue 6, 2007, Pages 870-889

  Rabinovich, Alexander ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER CIRCUITS;

ALGEBRAIC FRAMEWORK; MONADIC LOGIC; MONADIC SECOND-ORDER LOGIC; SECOND ORDERS; THEORETICAL METHODS; UNIFORMIZATION;

COMPUTABILITY AND DECIDABILITY;

EID: 84855204422     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2006.12.004     Document Type: Article

References (18)

1. J. R. Büchi, On a decision method in restricted second order arithmetic, in: E. Nagel (Ed.), Proceedings the of International Congress on Logic, Methodology and Philosophy of Science, Stanford University Press, Stanford, CA, 1960, pp. 1-11.
2. J. R. Büchi, L. H. Landweber, Solving sequential conditions by finite-state strategies, Transactions of the American Mathematical Society 138(1969) 295-311.
3. O. Carton, W. Thomas, The monadic theory of morphic infinite words and generalizations, in: MFCS, 2000, pp. 275-284.
4. O. Carton, W. Thomas, The monadic theory of morphic infinite words and generalizations, Information and Computation 176(1) (2002) 51-65.
5. Y. Choueka. Finite Automata on Infinite Structure, Ph. D Thesis, Hebrew University, 1970.
6. C. Elgot, M. O. Rabin, Decidability and undecidability of extensions of second (first) Order theory of (generalized) Successor, Journal of Symbolic Logic 31(2) (1966) 169-181.
7. S. Feferman, R. L. Vaught, The first-order properties of products of algebraic systems, Fundamenta Mathematica 47(1959) 57-103.
8. Y. Gurevich, Monadic second order theories, in: J. Barwise, S. Feferman (Eds.), Model Theoretical Logics, Springer Verlag, Berlin, 1986, pp. 479-506.
9. S. Lifsches, S. Shelah, Uniformization and Skolem functions in the class of trees, Journal of Symbolic Logic 63(1998) 103-127.
10. 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(2006) 343-344.
11. A. Rabinovich, W. Thomas, Decidable Theories of the Ordering of Natural Numbers with Unary Predicates, CSL 2006, 2006, pp. 562-574. (Pubitemid 44617582)
12. R. M. Robinson, Restricted set-theoretical definitions in arithmetic, in: Proceedings of the American Mathematical Society, vol. 9, No. 2, 1958, pp. 238-242.
13. 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.
14. S. Shelah, The monadic theory of order, Annals of Mathematics 102(1975) 349-419.
15. D. Siefkies, Decidable extensions of monadic second-order successor arithmetic, in: J. Doerr, G. Hotz (Eds.), Automatentheorie und Formale Sprachen, 1970, pp. 441-472.
16. W. Thomas, Das Entscheidungsproblem für einige Erweiterungen der Nachfalger-Arithmetic. Ph. D. Thesis Albert-Ludwigs Universität, 1975.
17. W. Thomas, Ehrenfeucht Games, the composition method, and the monadic theory of ordinal words, in: Structures in Logic and Computer Science: A Selection of Essays in Honor of A. Ehrenfeucht, Lecture Notes in Computer Science, 1261, Springer-Verlag, Berlin, 1997, pp. 118-143. (Pubitemid 127109928)
18. B. A. Trakhtenbrot, Finite automata and the logic of one-place predicates, in: AMS Transl. 59, 1966, pp. 23-55 (Russian version 1961).