Siberian Mathematical Journal

, Volume 20, Issue 6, pp 900–904 | Cite as

Computability of partial functions and enumerability of sets in Peano's arithmetic

  • I. A. Lavrov
Article
Received:
  • 15 Downloads

Keywords

Partial Function 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Literature Cited

  1. 1.
    A. Tarski, A. Mostowski, and R. M. Robinson, Undecidable Theories, North-Holland, Amsterdam (1953).Google Scholar
  2. 2.
    A. Ehrenfeucht and S. Feferman, “Representability of recursively enumerable sets in formal theories,” Arch. Math. Logik Grundlagenforsch, No. 5, 37–41 (1960).Google Scholar
  3. 3.
    J. C. Shepherdson, “Representability of recursively enumerable sets in formal theories,” Arch. Math. Logik Grundlagenforsch, No. 5, 119–127 (1960).Google Scholar
  4. 4.
    W. E. Ritter, “Representability of partial recursive functions in formal theories,” Proc. Am. Math. Soc.,18, No. 4, 647–651 (1967).Google Scholar
  5. 5.
    R. W. Ritchie and P. R. Young, “Strong representability of partial functions in arithmetic theories,” Inf. Sci.,1, No. 2, 189–204 (1969).Google Scholar
  6. 6.
    J. R. Schoenfield, Mathematical Logic, Addison-Wesley, Reading, Mass., (1967).Google Scholar
  7. 7.
    S. Feferman, “Arithmetization of metamathematics in a general setting,” Fund. Math.,49, No. 1, 35–92 (1960).Google Scholar

Copyright information

© Plenum Publishing Corporation 1980

Authors and Affiliations

  • I. A. Lavrov

There are no affiliations available

Personalised recommendations