|
Vestnik Novosibirskogo Gosudarstvennogo Universiteta. Seriya Matematika, Mekhanika, Informatika, 2011, Volume 11, Issue 4, Pages 63–68
(Mi vngu100)
|
|
|
|
This article is cited in 1 scientific paper (total 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.
Received: 26.06.2009
Citation:
M. N. Leontyeva, “Sufficient Conditions of Decidability of Boolean Algebras”, Vestn. Novosib. Gos. Univ., Ser. Mat. Mekh. Inform., 11:4 (2011), 63–68; J. Math. Sci., 195:6 (2013), 827–831
Linking options:
https://www.mathnet.ru/eng/vngu100 https://www.mathnet.ru/eng/vngu/v11/i4/p63
|
Statistics & downloads: |
Abstract page: | 166 | Full-text PDF : | 67 | References: | 48 | First page: | 2 |
|