The index set of Boolean algebras autostable relative to strong constructivizations
Sergey Savostyanovich Goncharov, Nikolay A. Bazhenov, M. I. Marchuk · Siberian Mathematical Journal · 2015
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.