Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras.

It is proved that for every computable ordinal α, the Turing degree 0 is a degree of autostability of some computable Boolean algebra and is also a degree of autostability relative to strong constructivizations for some decidable Boolean algebra. It is shown that a Harrison Boolean algebra has no degree of autostability relative to strong constructivizations. It is stated that the index set of decidable Boolean algebras having degree of autostability relative to strong constuctivizations is ∏-complete. [ABSTRACT FROM AUTHOR]