Skip to main content
SpringerLink
Log in

On nonprincipal enumerations

  • 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, “On computable enumeration,” Algebra i Logika,7, No. 5, 71–99 (1968).

    Google Scholar 

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

  3. A. H. Lachlan, “A note on universal sets,” J. Symb. Logic,31, No. 4, 573–574 (1966).

    Google Scholar 

  4. A. H. Lachlan, “Standard classes of recursively-enumerable sets,” Z. Math. Log. Grund. Math.,10, 23–42 (1964).

    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. 6, pp. 726–732, November–December, 1969.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Khutoretskii, A.B. On nonprincipal enumerations. Algebr Logic 8, 412–415 (1969). https://doi.org/10.1007/BF02219655

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation