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.