Abstract:
We give an algebraic description for autostable (computably categorical) Boolean algebras with a finite set of distinguished ideals. It is proved that an elementary theory for every such algebra is $\omega$-categorical and decidable.
Keywords:autostable (computably categorical) Boolean algebra with finite set of distinguished ideals, elementary theory, $\omega$-categorical theory, decidable theory.