Skip to main content
SpringerLink
Log in

On incomparable enumerations

  • 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. Yu. L. Ershov, Theory of Enumerations, Part I [in Russian], Izd-vo NGU, Novosibirsk (1969).

    Google Scholar 

  2. S. D. Denisov, “On m-degrees of recursively enumerable sets,” Algebra i Logika,9, No. 4, 422–427 (1970).

    Google Scholar 

  3. A. B. Khutoretskii, “On nonprincipal enumerations,” Algebra i Logika,8, No. 6, 726–732 (1969).

    Google Scholar 

  4. S. S. Marchenkov, “On computable enumerations of general recursive functions,” Algebra i Logika,11, No. 5, 588–607 (1972).

    Google Scholar 

Download references

Authors
  1. S. A. Badaev
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Sibirskii Matematicheskii Zhurnal, Vol. 15, No. 4, pp. 730–738, July–August, 1974.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Badaev, S.A. On incomparable enumerations. Sib Math J 15, 519–524 (1974). https://doi.org/10.1007/BF00967428

Download citation

  • Received:

  • Issue Date:

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

Search

Navigation