M. N. Leontyeva, “The minimality of certain decidability conditions for Boolean algebras”, Sibirsk. Mat. Zh., 2012, Volume 53, Number 1,Pages <nobr>132

This article is cited in 2 papers

The minimality of certain decidability conditions for Boolean algebras

M. N. Leontyeva^ab

^a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk
^b Novosibirsk State University, Novosibirsk

Abstract: We complete our study of the decidability of Boolean algebras in terms of computability of a certain sequence of canonical ideals. We present a proof of the minimality of the conditions obtained for the decidability of Boolean algebras of all elementary characteristics.

Keywords: Boolean algebra, computable set, computable model, strongly computable model, $n$-computability, decidable model, elementary characteristic of a Boolean algebra, Ershov–Tarski ideal.

UDC: 510.5+510.6+512.563

Received: 31.05.2011