|
This article is cited in 1 scientific paper (total in 1 paper)
Computable ideals in $I$-algebras
P. E. Alaevab a Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Abstract:
We give algebraic descriptions of relatively intrinsically computable ideals in $I$-algebras (Boolean algebras with a finite number of distinguished ideals) and of intrinsically computable ideals for the case of two distinguished ideals in the language of $I$-algebras.
Keywords:
Boolean algebra with finite number of distinguished ideals, intrinsically computable ideal, relatively intrinsically computable ideal.
Received: 18.09.2008 Revised: 13.03.2009
Citation:
P. E. Alaev, “Computable ideals in $I$-algebras”, Algebra Logika, 49:2 (2010), 157–174; Algebra and Logic, 49:2 (2010), 103–114
Linking options:
https://www.mathnet.ru/eng/al433 https://www.mathnet.ru/eng/al/v49/i2/p157
|
Statistics & downloads: |
Abstract page: | 281 | Full-text PDF : | 96 | References: | 37 | First page: | 4 |
|