M. N. Leontyeva, “Sufficient Conditions of Decidability of Boolean Algebras”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 2011, Volume 11, Issue 4,Pages <nobr>63

This article is cited in 1 paper

Sufficient Conditions of Decidability of Boolean Algebras

M. N. Leontyeva

Novosibirsk State University

Abstract: 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.

UDC: 510.5+510.6+512.563

Received: 26.06.2009