This is a preview of subscription content, log in via an institution to check access.
Literature Cited
D. R. Büchi, “Weak second-order arithmetic and finite automata,” Kiberneticheskii Sb.,8, 42–77 (1964).
D. Siefkes, “Büchi's monadic second order successor arithmetic,” Lect. Notes in Mathematics, Vol. 120 Springer-Verlag, New York (1970).
M. O. Rabin, and D. Scott, “Finite automata and their decision problems,” Kiberneticheskii Sb.,4, 58–91 (1962).
D. R. Büchi, “A decision method for a restricted second-order arithmetic,” Kiberneticheskii Sb.,8, 78–90 (1964).
C. C. Elgot, “Decision problems of finite automata design and related arithmetics,” Trans. Am. Math. Soc.,98, No. 1, 21–51 (1961).
A. A. Nabebin, “On elementary theories of machine-computable predicates,” Uch. Zap. Ivanovsk. Ped. Inst.,106, Nos. 1–2 19–35 (1972). (Proceedings of the Combined Mathematics Faculty of the Pedagogical Institutes of the Central Russian Soviet Federated Socialist Republic).
B. A. Trakhtenbrot, “Finite automata and the logic of one-place predicates,” Sib. Mat. Zh.,3, No. 1, 103–131 (1962).
R. McNaughton, “Undefinability of addition from one unary operator,” Trans. Am. Math. Soc.,117, No. 5, 329–337 (1965).
Additional information
Translated from Sibirskii Matematicheskii Zhurnal, Vol. 18, No. 4, pp. 830–837, July–August, 1977.
Rights and permissions
About this article
Cite this article
Nabebin, A.A. Expressibility in a restricted second-order arithmetic. Sib Math J 18, 588–593 (1977). https://doi.org/10.1007/BF00967200
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00967200