Skip to main content
SpringerLink
Log in

On discrete families of recursively enumerable sets

  • 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. Yu. L. Ershov, Theory of Enumerations, Part 1 [in Russian], Novosibirsk Gos. Univ. (1969).

  2. Yu. L. Ershov, "On computable enumerations," Algebra i Logika,7, No. 5, 71–99 (1968).

    Article  Google Scholar 

  3. A. I. Mal'tsev, "Positive and negative enumerations," Dokl. Akad. Nauk SSSR,160, No. 2, 278–280 (1965).

    Google Scholar 

  4. S. S. Marchenkov, "On minimal enumerations of systems of recursively enumerable sets," Dokl. Akad. Nauk SSSR,198, No. 3, 530–532 (1971).

    Google Scholar 

  5. V. A. Uspenskii, "On computable operations," Dokl. Akad. Nauk SSSR,103, No. 5, 773–776 (1955).

    Google Scholar 

Download references

Authors
  1. V. V. V'yugin
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 11, No. 3, pp. 243–256, May–June, 1972.

Rights and permissions

Reprints and permissions

About this article

Cite this article

V'yugin, V.V. On discrete families of recursively enumerable sets. Algebr Logic 11, 137–144 (1972). https://doi.org/10.1007/BF02218608

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation