Computable ideals in I-algebras

Abstract

Keywords: Boolean algebra with finite number of distinguished ideals, intrinsically computable ideal, relatively intrinsically computable ideal.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.