Sufficient Conditions of Decidability of Boolean Algebras
Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 11 (2011) no. 4, pp. 63-68

Voir la notice de l'article provenant de la source Math-Net.Ru

In order to complete an investigation of decidability of Boolean algebras in terms of computability of a sequence of canonical ideals in this paper we present a proof of sufficiency of conditions obtained for Boolean algebras of every elementary characteristic.
Keywords: Boolean algebras, computable set, computable model, strongly computable model, $n$-computability, elementary charakteristic of Boolean algebra, Ershov–Tarski ideal, Frechet ideal.
@article{VNGU_2011_11_4_a5,
     author = {M. N. Leontyeva},
     title = {Sufficient {Conditions} of {Decidability} of {Boolean} {Algebras}},
     journal = {Sibirskij \v{z}urnal \v{c}istoj i prikladnoj matematiki},
     pages = {63--68},
     publisher = {mathdoc},
     volume = {11},
     number = {4},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/VNGU_2011_11_4_a5/}
}
TY  - JOUR
AU  - M. N. Leontyeva
TI  - Sufficient Conditions of Decidability of Boolean Algebras
JO  - Sibirskij žurnal čistoj i prikladnoj matematiki
PY  - 2011
SP  - 63
EP  - 68
VL  - 11
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/VNGU_2011_11_4_a5/
LA  - ru
ID  - VNGU_2011_11_4_a5
ER  - 
%0 Journal Article
%A M. N. Leontyeva
%T Sufficient Conditions of Decidability of Boolean Algebras
%J Sibirskij žurnal čistoj i prikladnoj matematiki
%D 2011
%P 63-68
%V 11
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/VNGU_2011_11_4_a5/
%G ru
%F VNGU_2011_11_4_a5
M. N. Leontyeva. Sufficient Conditions of Decidability of Boolean Algebras. Sibirskij žurnal čistoj i prikladnoj matematiki, Tome 11 (2011) no. 4, pp. 63-68. http://geodesic.mathdoc.fr/item/VNGU_2011_11_4_a5/