On autostability of almost prime models relative to strong constructivizations
С. С. Гончаров · Russian Mathematical Surveys · 2011
Questions of autostability and algorithmic dimension of models go back to papers by A.I. Malcev and by A. Frohlich and J.C. Shepherdson in which the effect of the existence of computable presentations which are non-equivalent from the viewpoint of their algorithmic properties was first discovered. Today there are many papers by various authors devoted to investigations of such questions. The present paper deals with the question of inheritance of the properties of autostability and non-autostability relative to strong constructivizations under elementary extensions for almost prime models. Bibliography: 37 titles.