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

Algebra Logika, 2001 Volume 40, Number 5, Pages 561–579 (Mi al236)

This article is cited in 5 papers

Universal Numbering for Constructive $I$-Algebras

N. T. Kogabaev

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Abstract: Constructive Boolean algebras with distinguished ideals (we call them $I$-algebras in what follows) are studied. It is proved that a class of all constructive $I$-algebras is strongly computable, that is, the class of constructive $I$-algebras contains a principal computable numbering.

Keywords: constructive Boolean algebras with distinguished ideals, principal computable numbering.

UDC: 510.5+512.563

Received: 24.11.1999


 English version:
Algebra and Logic, 2001, 40:5, 315–326

Bibliographic databases:


© Steklov Math. Inst. of RAS, 2024