Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems
- 19 February 1996
- journal article
- Published by Elsevier in Annals of Pure and Applied Logic
- Vol. 77 (3) , 251-277
- https://doi.org/10.1016/0168-0072(95)00022-4
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The definable criterion for definability in Presburger arithmetic and its applicationsTheoretical Computer Science, 2003
- The theory of
N , +, VTheoretical Computer Science, 1992 - Joining k- and l-recognizable sets of natural numbersPublished by Springer Nature ,1992
- Finite AutomataPublished by Elsevier ,1990
- ON CERTAIN EXTENSIONS OF THE ARITHMETIC OF ADDITION OF NATURAL NUMBERSMathematics of the USSR-Izvestiya, 1980
- Presburgerness of predicates regular in two number systemsSiberian Mathematical Journal, 1977
- On the base-dependence of sets of numbers recognizable by finite automataTheory of Computing Systems, 1969
- J. Richard Büchi. Weak second-order arithmetic and finite automata. Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 6 (1960), pp. 66–92. - J. Richard Büchi. On a decision method in restricted second order arithmetic. Logic, methodology and philosophy of science, Proceedings of the 1960 International Congress, edited by Ernest Nagel, Patrick Suppes, and Alfred Tarski, Stanford University Press, Stanford, Calif., 1962, pp. 1–11.The Journal of Symbolic Logic, 1963
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960
- Finite AutomataPhilosophy, 1958