Skip to main content
SpringerLink
Log in

Semilattices of computable indexations of classes of constructive models

  • 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, The Theory of Numerations [in Russian], Nauka, Moscow (1977)

    Google Scholar 

  2. Yu. L. Ershov, Problems of Decidability and Constructive Models [in Russian], Nauka, Moscow (1980).

    Google Scholar 

  3. H. Rogers, The Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1974).

    Google Scholar 

  4. V. P. Dobritsa, "Complexity of the index set of a constructive model," Algebra Logika,22, No. 4, 372–381 (1983).

    Google Scholar 

Download references

Authors
  1. V. P. Dobritsa
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Algebra i Logika, Vol. 26, No. 5, pp. 558–576, September–October, 1987.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dobritsa, V.P. Semilattices of computable indexations of classes of constructive models. Algebra and Logic 26, 333–345 (1987). https://doi.org/10.1007/BF01978690

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation