Skip to main content
SpringerLink
Log in

A class of recursively enumberable sets

  • Published:
Siberian Mathematical Journal 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

Literature Cited

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

    Google Scholar 

  2. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka, Moscow (1972).

    Google Scholar 

  3. C. E. M. Yates, “Recursively enumerable sets and retracing functions,” Z. Math. Logik Grundl. Math.,8, No. 3/4, 331–345 (1962).

    Google Scholar 

  4. J. C. E. Dekker, “Two notes on recursively enumerable sets,” Proc. Am. Math. Soc.,4, 495–501 (1953).

    Google Scholar 

Download references

Authors
  1. A. S. Morozov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Novosibirsk. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 28, No. 2, pp. 124–128, March–April, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Morozov, A.S. A class of recursively enumberable sets. Sib Math J 28, 278–282 (1987). https://doi.org/10.1007/BF00970874

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation