Abstract:
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.
Keywords:model, computable model, constructive model, autostability, index sets.