Skip to main content
SpringerLink
Log in

Representability op recursively enumerable sets in 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. Craig, W.,On axiomatizability within a system,Journal of Symbolic Logic, vol. 18 (1953), pp. 30–32.

    Google Scholar 

  2. Feferman, S.,Degrees of unsolvability associated with classes of formalized theories,Journal of Symbolic Logic, vol. 22 (1957), pp. 161–175.

    Google Scholar 

  3. Kleene, S. C.,Introduction to metamathematics, Amsterdam, Groningen, New York and Toronto, 1952, X + 550 pp.

  4. Myhill, J.,Creative sets,Zeitschrift für mathematische Logik und Grundlagen der Mathematik, vol. 1 (1955), pp. 97–108.

    Google Scholar 

  5. Rogers, Hartley, Jr.,Theory of recursive functions and effective computability, vol. I (mimeographed), Department of Mathematics, Massachusetts Institute of Technology, 1956, xiii + 155 pp.

  6. Shoenfield, J. R.,Degrees of formal systems,Journal of Symbolic Logic, vol. 23 (1958), pp. 389–392.

    Google Scholar 

  7. Tarski, A., Mostowski, A. and Robinson, R. M.,Undecidable theories, Amsterdam, 1953, XI + 98 pp.

Download references

Author information

Authors and Affiliations

  1. Berkeley, Calif.

    A. Ehrenfeucht

  2. Stanford, Calif.

    S. Feferman

Authors
  1. A. Ehrenfeucht
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. Feferman
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

The work of the second author on this paper was carried out during a period of support by a grant from the National Science Foundation. We wish to thank G. Kreisel for his helpful comments regarding the writing of this paper.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ehrenfeucht, A., Feferman, S. Representability op recursively enumerable sets in formal theories. Arch math Logik 5, 37–41 (1960). https://doi.org/10.1007/BF01977641

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation