Autostable atomic-ideal enrichments of computable Boolean algebras
Pavel E. Alaev · Doklady Mathematics · 2010
The paper is devoted to an algebraic description of autostable (computably categorical) Boolean algebras in a language enriched by predicates distinguishing a finite set of ideals and atoms with respect to some ideals in this set.