Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras
- 33 Downloads
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 ∏ 1 1 -complete.
Keywordsautostability Boolean algebra autostability relative to strong constructivizations degree of autostability degree of categoricity index set
Unable to display preview. Download preview PDF.
- 7.S. S. Goncharov and Yu. L. Ershov, Constructive Models, Siberian School of Algebra and Logic [in Russian], Nauch. Kniga, Novosibirsk (1999).Google Scholar
- 9.S. S. Goncharov, Countable Boolean Algebras and Decidability, Sib. School Alg. Log. [in Russian], Nauch. Kniga, Novosibirsk (1996).Google Scholar