Siberian Mathematical Journal

, Volume 35, Issue 1, pp 62–64 | Cite as

Conditions of effective infinity for the set of computable indexings of a class of constructive models

  • V. P. Dobritsa


Constructive Model Computable Indexing 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S. S. Goncharov, “Autostability of models and Abelian groups,” Algebra i Logika,19, No. 1, 23–44 (1980).Google Scholar
  2. 2.
    V. P. Dobritsa, “Computability of certain classes of constructive algebras,” Sibirsk. Mat. Zh.,18, No. 3, 570–579 (1977).Google Scholar
  3. 3.
    V. P. Dobritsa, “Complexity of the index set of a constructive model,” Algebra i Logika,22, No. 4, 372–381 (1983).Google Scholar
  4. 4.
    V. P. Dobritsa, “Structural properties of computable classes of constructive models,” Algebra i Logika,26, No. 1, 36–62 (1987).Google Scholar
  5. 5.
    V. P. Dobritsa, “Local classes and computable indexings,” Algebra i Logika,26, No. 2, 165–190 (1987).Google Scholar
  6. 6.
    Yu. L. Ershov, Decision Problems and Constructive Models [in Russian], Nauka, Moscow (1980).Google Scholar
  7. 7.
    H. Rogers, Theory of Recursive Functions and Effective Computability [Russian translation], Mir, Moscow (1972).Google Scholar

Copyright information

© Plenum Publishing Corporation 1994

Authors and Affiliations

  • V. P. Dobritsa
    • 1
  1. 1.Almaty

Personalised recommendations