Skip to main content
SpringerLink
Log in

Recursively enumerable classes and their application to recursive sequences of formal theories

  • Published:
Archiv für mathematische Logik und Grundlagenforschung Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Bibliography

  1. Dekker, J. C. E., and J. Myhill, Some theorems on classes of recursively enumerable sets.Trans. Amer. Math. Soc. 89, No. 1 (1958), pp. 25–59.

    Google Scholar 

  2. Ehrenfeucht, A., Two theories with axioms built by means of pleonasms.The Journal of Symbolic Logic 22, No. 1 (1957), pp. 36–38.

    Google Scholar 

  3. Friedberg, R., Three theorems on recursive enumeration.The Journal of Symbolic Logic 23, No. 3 (1958), pp. 309–316.

    Google Scholar 

  4. Kleene, S. C., Introduction to metamathematics. New York, Van Nostrand, Amsterdam, North Holland Publishing Co. and Groningen, Noordhoff, 1952, x + 550 pp.

    Google Scholar 

  5. Pour-El, M. B.,Review of [3],The Journal of Symbolic Logic 25, No. 2 (1960), pp. 165–166.

    Google Scholar 

  6. Tarski, A., A. Mostowski, and R. M. Robinson, Undecidable theories. Studies in Logic and the Foundations of Mathematics North Holland-Publishing Co., Amsterdam, 1953, 98 pp.

Download references

Authors
  1. Marian Boykan Pour-El
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hilary Putnam
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

This manuscript was completed while Marian Boykan Pour-El held a grant awarded by the Institute for Advanced Study (from funds the Institute derived from NSF-G21514).

The contribution of Hilary Putnam to this research was supported by a grant from the Air Force Office of Scientific Research, Mathematical Sciences Directorate.

Some of the results in this paper appear in abstract and technical report form (61T- 255, Notices of the American Mathematical Society, October 1961, and AFOSR 818, issued by New York University as IMM-NYU 291). Our most grateful thanks to William Craig and William Howard for many helpful suggestions. Additional thanks are due to William Craig for very valuable advice in the preparation of this manuscript.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pour-El, M.B., Putnam, H. Recursively enumerable classes and their application to recursive sequences of formal theories. Arch math Logik 8, 104–121 (1965). https://doi.org/10.1007/BF01976264

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01976264

Keywords

Search

Navigation