Skip to main content
SpringerLink
Log in

Complexity of index sets of calculable classes with a finite number of constructive systems

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

    Google Scholar 

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

    Google Scholar 

  3. V. P. Dobritsa, “On the complexity of the index set of a constructive enumeration,” in: VI All-Union Conf. on Math. Logic (Lecture Theses), Tbilisi State Univ. (1982), p. 60.

  4. V. P. Dobritsa, “The complexity of the index set of a constructive model,” Algebra Logika,22, No. 4, 372–381 (1983).

    Google Scholar 

  5. V. P. Dobritsa, “On calculable classes of constructive systems with complex index sets,” in: VII All-Union Conf. on Math. Logic (Lecture Theses), Inst. of Math., Siberian Branch, Academy of Sciences of the USSR, Novosibirsk (1984), p. 61.

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. Translated from Sibirskii Matematicheskii Zhurnal, Vol. 27, No. 5, pp. 68–74, September–October, 1986.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dobritsa, V.P. Complexity of index sets of calculable classes with a finite number of constructive systems. Sib Math J 27, 685–690 (1986). https://doi.org/10.1007/BF00969196

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation