Skip to main content
SpringerLink
Log in

Two existence theorems for computable numerations

  • Published:
Algebra and Logic Aims and scope

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

Literature cited

  1. D. A. Martin, “Classes of recursively enumerable sets and degrees of unsolvability,” Z. Math. und Grundl. Math.,12, No. 4, pp. 295–310 (1966).

    MATH  Google Scholar 

  2. H. Rogers, Jr., Theory of Recursive Functions and Effective Computability, McGraw-Hill (1967).

  3. G. E. Sacks, Degrees of Unsolvability, Ann. of Math. Studies, No. 55, Princeton, N. J., Princeton Univ. Press (1963).

    Google Scholar 

  4. C. E. M. Yates, “Three theorems on the degrees of recursively enumerable sets,” Duke Math. Journal,32, No. 3, pp. 461–468 (1965).

    Article  MATH  MathSciNet  Google Scholar 

  5. Yu. L. Ershov, “On computable numerations,” Algebra i Logika,7, No. 5, pp. 71–99 (1968).

    MathSciNet  Google Scholar 

  6. A. B. Khutoretskii, “On reducibility of computable numerations,” Algebra i Logika,8, No. 2, pp. 251–264 (1969).

    MathSciNet  Google Scholar 

Download references

Authors
  1. A. B. Khutoretskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 8, No. 4, pp. 483–492, July–August, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khutoretskii, A.B. Two existence theorems for computable numerations. Algebr Logic 8, 277–282 (1969). https://doi.org/10.1007/BF02306734

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation