Skip to main content
SpringerLink
Log in

On some examples of upper semilattices of computable 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, Theory of Enumerations [in Russian], Novosibirsk (1969).

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

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

    Google Scholar 

  4. A. B. Khutoretskii, "On the power of upper semilattice of computable enumerations," Algebra i Logika,10, No. 5, 561–569 (1971).

    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. 12, No. 5, pp. 512–529, September–October, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

V'yugin, V.V. On some examples of upper semilattices of computable enumerations. Algebr Logic 12, 287–296 (1973). https://doi.org/10.1007/BF02218587

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation