The index set of Boolean algebras autostable relative to strong constructivizations
- First Online:
We obtain exact estimates for the algorithmic complexity for the classes of strongly constructivizable computable models autostable relative to strong constructivizations and belonging to the following natural classes: Boolean algebras, distributive lattices, rings, commutative semigroups, and partial orders.
Keywordscomputable model strongly constructivizable model autostability autostability relative to strong constructivizations Boolean algebra distributive lattice ring commutative semigroup partial order hyperarithmetic hierarchy index set
Unable to display preview. Download preview PDF.