Degrees of Autostability Relative to Strong Constructivizations for Boolean Algebras


Citar

Texto integral

Acesso aberto Acesso aberto
Acesso é fechado Acesso está concedido
Acesso é fechado Somente assinantes

Resumo

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 ∏11-complete.

Sobre autores

N. Bazhenov

Sobolev Institute of Mathematics; Novosibirsk State University; Kazan (Volga Region) Federal University

Autor responsável pela correspondência
Email: bazhenov@math.nsc.ru
Rússia, pr. Akad. Koptyuga 4, Novosibirsk, 630090; ul. Pirogova 2, Novosibirsk, 630090; ul. Kremlevskaya 18, Kazan, 420008

Arquivos suplementares

Arquivos suplementares
Ação
1. JATS XML

Declaração de direitos autorais © Springer Science+Business Media New York, 2016