Algebra and Logic

, Volume 33, Issue 2, pp 79–84 | Cite as

Constructive models of regularly infinite algorithmic dimension

  • Yu. G. Ventsov
Article

Abstract

A certain class of models of infinite algorithmic dimension is described; included in the class are branching and unbounded models.

Keywords

Mathematical Logic Constructive Model Algorithmic Dimension Unbounded Model 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    S. S. Goncharov, “Autostability of models and Abelian groups,”Algebra Logika,19, No. 1, 23–44 (1980).Google Scholar
  2. 2.
    S. S. Goncharov and V. D. Dzgoev, “Autostability of models,”Algebra Logika,19, No. 9, 45–58 (1980).Google Scholar
  3. 3.
    Yu. G. Ventsov, “Algorithmic properties of branching models,”Algebra Logika,25, No. 9, 369–383 (1980).Google Scholar
  4. 4.
    Yu. G. Ventsov, “Computable classes of constructivizations for models of infinite algorithmic dimension,”Algebra Logika,33, No. 1, 37–75 (1994).Google Scholar
  5. 5.
    Yu. G. Ventsov, “Constructive models of infinite algorithmic dimension,” to appear in:Dokl. Ros. Akad. Nauk. Google Scholar
  6. 6.
    S. S. Goncharov, “The problem of the number of non-autoequivalent constructivizations,”Dokl. Akad. Nauk. SSSR,251, No. 2, 271–274 (1980).Google Scholar
  7. 7.
    Yu. L. Ershov,Decidability Problems and Constructive Models [in Russian], Nauka, Moscow (1980).Google Scholar
  8. 8.
    A. I. Mal'tsev, “Constructive models. I,”Usp. Mat. Nauk,16, No. 3, 3–60 (1961).Google Scholar
  9. 9.
    Yu. G. Ventsov, “Algorithmic dimension of models,”Dokl. Akad. Nauk SSSR,305, No. 1, 21–24 (1989).Google Scholar

Copyright information

© Plenum Publishing Corporation 1994

Authors and Affiliations

  • Yu. G. Ventsov

There are no affiliations available

Personalised recommendations