RUS  ENG
Full version
JOURNALS // Algebra i logika // Archive

Algebra Logika, 2010 Volume 49, Number 2, Pages 157–174 (Mi al433)

This article is cited 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.

UDC: 512.563+510.6+510.5

Received: 18.09.2008
Revised: 13.03.2009


 English version:
Algebra and Logic, 2010, 49:2, 103–114

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2025