Undecidable extensions of Büchi arithmetic and Cobham-Semenov theorem

Journal of Symbolic Logic

Volumn 62, Issue 4, 1997, Pages 1280-1296

  Bès, Alexis ^a  

^a UNIVERSITÉ PARIS DESCARTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0031315943     PISSN: 00224812     EISSN: None     Source Type: Journal    
DOI: 10.2307/2275643     Document Type: Article

References (15)

1. V. BRUYÈRE, Entiers et automates finis, U.E. Mons, mémoire de licence, 1984-85.
2. J. R. BÜCHI, Weak second-order arithmetic and finite automata, Zeitschrift für Math. Logic Grundlagen Math., vol. 6 (1960), pp. 66-92.
3. G. CHERLIN and F. POINT, On extensions of Presburger arithmetic, Proceedings of the 4th Easter Model Theory conference, Gross Köris 1986 Seminarberichte 86, Humboldt Universität zu Berlin, 1986, pp. 17-34.
4. A. COBHAM, On the base-dependance of sets of numbers recognizable by finite automata, Mathematical Systems Theory, vol. 3 (1969), pp. 186-192.
5. S. EILENBERG, Automata, languages and machines, vol. A, Academic Press, New York, 1974.
6. C. C. ELGOT and M. O. RABIN, Decidability and undecidability of extensions of second (first) order theory of (generalized) successor, this JOURNAL, vol. 31 (1966), no. 2, pp. 169-181.
7. G. HANSEL, A propos d'un théorème de Cobham, Actes de la Fête ties Mots, Greco de Programmation, CNRS, Rouen, France (D. Perrin, editor), 1992.
8. B. HODGSON, Décidabilité par automate fini, Les Annales des Sciences Mathématiques du Québec, vol. 7 (1983), pp. 39-57.
9. C. MICHAUX and R. VILLEMAIRE, Open problems on Büchi and Presburger arithmetics, Logic: From foundations to applications, European Logic Colloquium, Oxford University Press, 1996, pp. 353-383.
10. _, Presburger arithmetic and recognizability of sets of natural numbers by automata: new proofs of Cobham's and Semenov's theorems, Annals of Pure and Applied Logic, vol. 77 (1996), pp. 251-277.
11. A. MUCHNIK, Definable criterion for definability in Presburger arithmetic and its application, Institute of new technologies, 1991, in Russian, preprint.
12. A. L. SEMENOV, The Presburger nature of predicates that are regular in two number systems, Siberian Mathematics Journal, vol. 18 (1977), no. 2, pp. 289-299.
13. W. THOMAS, A note on undecidable extensions of monadic second order successor arithmetic, Archive for Mathematical Logic, vol. 17 (1975), pp. 43-44.
14. R. VILLEMAIRE, Joining k- and l-recognizable sets of natural numbers, Proceedings of the 9th Symposium on Theoretical Aspects of Computer Science (STACS'92) Paris, France, Springer Lecture Notes in Computer Science, vol. 577, 1992, pp. 83-94.
15. l〉 is undecidable, Theoretical Computer Science, vol. 106 (1992), pp. 337-349.