|
Sibirskii Matematicheskii Zhurnal, 2012, Volume 53, Number 1, Pages 132–147
(Mi smj2294)
|
|
|
|
This article is cited in 4 scientific papers (total in 4 papers)
The minimality of certain decidability conditions for Boolean algebras
M. N. Leontyevaab 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.
Received: 31.05.2011
Citation:
M. N. Leontyeva, “The minimality of certain decidability conditions for Boolean algebras”, Sibirsk. Mat. Zh., 53:1 (2012), 132–147; Siberian Math. J., 53:1 (2012), 106–118
Linking options:
https://www.mathnet.ru/eng/smj2294 https://www.mathnet.ru/eng/smj/v53/i1/p132
|
Statistics & downloads: |
Abstract page: | 332 | Full-text PDF : | 89 | References: | 64 | First page: | 3 |
|