Decidable theories of the ordering of natural numbers with unary predicates

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

Volumn 4207 LNCS, Issue , 2006, Pages 562-574

  Rabinovich, Alexander ^a   Thomas, Wolfgang ^b  

^a TEL AVIV UNIVERSITY   (Israel)

^b RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; AUTOMATA THEORY; COMPUTER SCIENCE; FORMAL LOGIC; PROBLEM SOLVING;

DECIDABLE THEORIES; NATURAL NUMBERS; UNARY PREDICATES;

NUMBER THEORY;

EID: 33750356693     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11874683_37     Document Type: Conference Paper

References (20)

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, L.H. Landweber, Definability in the monadic second-order theory of successor. J. Symb. Logic 34, 166-170, 1969.
3. O. Carton and W.Thomas. The Monadic Theory of Morphic Infinite Words and Generalizations. In Proc. MFCS 2000, Springer LNCS 1893 (2000), 275-284.
4. O. Carton and W.Thomas. The Monadic Theory of Morphic Infinite Words and Generalizations. Inf. Comput. 776(1), pp. 51-65, 2002.
5. C. Elgot and M. O. Rabin. Decidability and Undecidability of Extensions of Second (First) Order Theory of (Generalized) Successor. J. Symb. Logic, 31(2), pp. 169-181, 1966.
6. Y. Gurevich. Monadic second order theories. In J. Barwise and S. Feferman eds.,em Model Theoretic Logics pp. 479-506, Springer Verlag, 1986.
7. S. Lifsches and S. Shelah. Uniformization and Skolem Functions in the Class of Trees. J. Symb. Logic, 63, 103-127, 1998.
8. A. Rabinovich. On decidability of monadic logic of order over the naturals extended by monadic predicates, manuscript, 2005, submitted.
9. R. M. Robinson. Restricted Set-Theoretical Definitions in Arithmetic. Proceedings of the American Mathematical Society, Vol. 9, No. 2. pp. 238-242, 1958.
10. H.R. Rogers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York 1967.
11. 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.
12. S. Shelah. The monadic theory of order. Ann. of Math. 102, 349-419, 1975.
13. H. Straubing. Finite Automata, Formal Logic, and Circuit Complexity, Birkhäuser, Boston, 1994.
14. D. Siefkes. Decidable extensions of monadic second-order successor arithmetic. In Automatentheorie und Formale Sprachen, J. Dörr and G. Hotz, Eds., pp 441-472, BI-Wissenschaftsverlag, Mannheim 1970.
15. W. Thomas. Das Entscheidungsproblem für einige Erweiterungen der Nachfolger-Arithmetik. Ph. D. Thesis Albert-Ludwigs Universität, Freiburg 1975.
16. W. Thomas. The theory of successor with an extra predicate. Math. Ann. 237, 121-132, 1978.
17. W. Thomas. Automata on infinite objects. In: Handbook of Theoretical Computer Science (J. v. Leeuwen, ed.), Vol. B, Elsevier, Amsterdam 1990, pp. 135-191.
18. 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:118-143, 1997, Springer-Verlag.
19. W. Thomas. Languages, automata, and logic. In: Handbook of Formal Languages (G. Rozenberg, A. Salomaa, eds.), Vol 3. Springer 1997, pp. 389-455.
20. B. A. Trakhtenbrot. Finite automata and the logic of one-place predicates. (Russian version 1961). In AMS Transl. 59, 1966, pp. 23-55.