Skip to main content
SpringerLink
Log in

Computability of some subclasses of the computable class of constructive models

  • 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, Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).

    Google Scholar 

  2. H. Rodgers, Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).

    Google Scholar 

  3. V. P. Dobritsa, “Structural properties of computable classes of constructive models,” Algebra Logika,26, No. 1, (1987).

  4. V. P. Dobritsa, “Local classes and computable indexings,” Algebra Logika,26, No. 2 (1987).

Download references

Authors
  1. V. P. Dobritsa
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Alma-Ata City. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 30, No. 3, pp. 45–51, May–June, 1989.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dobritsa, V.P. Computability of some subclasses of the computable class of constructive models. Sib Math J 30, 382–386 (1989). https://doi.org/10.1007/BF00971491

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation