Literature Cited
A. L. Semenov, “Presburgerness of sets recognizable by finite automata in two number systems,” Third All-Union Conference of Mathematical Logic. Reports Abstracts [in Russian], Izd. Inst. Math. Sib. Otdel. Akad. Nauk SSSR, Novosibirsk (1974), pp. 201–203.
J. R. Büchi, “Weak second-order arithmetic and finite automata,” Z. Math. Logik Grundl. Math.,6, No. 1, 66–92 (1960); Kiberneticheskii Sb., No. 8, 42–77 (1964).
A. Cobham, “On the base-dependence of sets of numbers, recognizable by finite automata,” Math. Systems Theory,3, No. 2, 186–192 (1969); Kiberneticheskii Sb., Nov. Ser., No. 8, 62–71 (1971).
S. Ginsburg and E. H. Spanier, “Semigroups, Presburger formulas and languages,” Pac. J. Math.,13, No. 4, 570–581 (1966).
J. W. Thatcher, “Decision problems for multiple successor arithmetics,” J. Symbolic Logic,31, No. 2, 182–190 (1966).
Additional information
Translated from Sibirskii Matematicheskii Zhurnal, Vol. 18, No. 2, pp. 403–418, March–April, 1977.
Rights and permissions
About this article
Cite this article
Semenov, A.L. Presburgerness of predicates regular in two number systems. Sib Math J 18, 289–300 (1977). https://doi.org/10.1007/BF00967164
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00967164