Algebra and Logic

, Volume 54, Issue 2, pp 108–126

Index Sets of Constructive Models of Bounded Signature that are Autostable Relative to Strong Constructivizations


We evaluate algorithmic complexity of the class of computable models of bounded signature that have a strong constructivization and are autostable relative to strong constructivizations.


model computable model constructive model autostability index sets 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Sobolev Institute of MathematicsNovosibirskRussia
  2. 2.Novosibirsk State UniversityNovosibirskRussia

Personalised recommendations