Algorithmic Stability of Models

  • B. M. Khoussainov
  • R. Dadajanov
Part of the Progress in Computer Science and Applied Logic book series (PCS, volume 12)

Abstract

In the first part of this paper we investigate relations between different types of algorithmic dimensions of models. We prove that there exists a recursive model which has different program and uniform dimensions. We find some conditions which are sufficient for systems to have the same uniform and program dimensions. In the second part the notion of finitely blocked models is given. We give an algebraic characterization of strongly finitely blocked algebraically stable systems in terms of notions of partially ordered sets, and investigate the problem of the number of recursive isomorphism types of finitely blocked models.

Keywords

Uzbekistan 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Ershov, Yu. L. [1977], Theory of Enumeration (in Russian), Moscow, Nauka.Google Scholar
  2. [2]
    Ershov, Yu. L. [1989], Problems of Decidability and Constructive Models (in Russian), Moscow.Google Scholar
  3. [3]
    Uspensky, V.A. and A.L. Semenov [1987], Theory of Algorithms: Basic Discoveries and Applications (in Russian), Moscow, Nauka.Google Scholar
  4. [4]
    Goncharov, S.S. [1980], Autostability of Models and Abelian Groups. Algebra and Logic, 19, No. 1, 13–28.MATHCrossRefGoogle Scholar
  5. [5]
    Goncharov, S.S. and V.D. Dzgoev [1980], Autostability of Models. Algebra and Logic, 19, No. 1, 28–38.MathSciNetMATHCrossRefGoogle Scholar
  6. [6]
    Goncharov, S.S. [1980], Problem of the Number of Non-Self-Equivalent Constructivizations, Algebra and Logic 19, no. 6, 401–414.MathSciNetMATHCrossRefGoogle Scholar
  7. [7]
    Remmel, J.B. [1981], Recursive Boolean Algebras with Recursive Atoms. J. Symbolic Logic, 46, 595–616.MathSciNetMATHCrossRefGoogle Scholar
  8. [8]
    Remmel, J.B. [1981], Recursive Isomorphism Types of Recursive Boolean Algebras. J. Symbolic Logic, 46, 572–593.MathSciNetMATHCrossRefGoogle Scholar
  9. [9]
    Moses, M. [1984], Recursive Properties of Isomorphism Types. Bull. Austral. Math. Soc, 29, 419–421.MATHCrossRefGoogle Scholar
  10. [10]
    Mal’cev, A.I. [1962], Recursive Abelian Groups (in Russian). Dokl. Akad. Nauk SSSR, 146, No. 5, 1009–1012.MathSciNetGoogle Scholar
  11. [11]
    Khoussainov, B.M. [1987], Strongly V-finite Theories of Unars. Matem. Zametsky, 41, No. 2, 265–271.MathSciNetGoogle Scholar
  12. [12]
    Khoussainov, B.M. [1988], Algorithmic Degrees of Unars. Algebra and Logic, 27, No. 4, 479–593.MathSciNetGoogle Scholar
  13. [13]
    Khoussainov, B.M. [1986], Strongly Effective Unary algebras and Nonautoequivalent Constructivizations. In: Certain Problems of Discrete Mathematics and Differential Equations. Novosibirsk, 33–45.Google Scholar
  14. [14]
    Khoussainov, B.M., Spectrum of Algorithmic Dimensions of Homo-morphisms of Models. Algebra and Logic, to appear.Google Scholar
  15. [15]
    Fedorjaev, S. [1990], Properties of the Algebraic Reducibility of Constructive Systems. Algebra and Logic 29, no. 5, 395–405.MathSciNetCrossRefGoogle Scholar
  16. [16]
    Rogers, H. [1967], Theory of Recursive Function and Effective Computability. New York.Google Scholar

Copyright information

© Springer Science+Business Media New York 1993

Authors and Affiliations

  • B. M. Khoussainov
    • 1
  • R. Dadajanov
    • 2
  1. 1.Novosibirsk UniversityRussia
  2. 2.Tashkent UniversityUzbekistan

Personalised recommendations