This is a preview of subscription content, log in via an institution to check access.
Literature Cited
A. Tarski, A. Mostowski, and R. M. Robinson, Undecidable Theories, North-Holland, Amsterdam (1953).
A. Ehrenfeucht and S. Feferman, “Representability of recursively enumerable sets in formal theories,” Arch. Math. Logik Grundlagenforsch, No. 5, 37–41 (1960).
J. C. Shepherdson, “Representability of recursively enumerable sets in formal theories,” Arch. Math. Logik Grundlagenforsch, No. 5, 119–127 (1960).
W. E. Ritter, “Representability of partial recursive functions in formal theories,” Proc. Am. Math. Soc.,18, No. 4, 647–651 (1967).
R. W. Ritchie and P. R. Young, “Strong representability of partial functions in arithmetic theories,” Inf. Sci.,1, No. 2, 189–204 (1969).
J. R. Schoenfield, Mathematical Logic, Addison-Wesley, Reading, Mass., (1967).
S. Feferman, “Arithmetization of metamathematics in a general setting,” Fund. Math.,49, No. 1, 35–92 (1960).
Additional information
Institute of Mathematics, Siberian Branch, Academy of Sciences of the USSR, Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 20, No. 6, pp. 1269–1274, November–December, 1979.
Rights and permissions
About this article
Cite this article
Lavrov, I.A. Computability of partial functions and enumerability of sets in Peano's arithmetic. Sib Math J 20, 900–904 (1979). https://doi.org/10.1007/BF00970389
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00970389