BOOLEAN ALGEBRAS OF ELEMENTARY CHARACTERISTIC (1,0,1) WHOSE SET OF ATOMS AND ERSHOV-TARSKI IDEAL ARE COMPUTABLE

作者：Leontieva M N^*

来源：Algebra and Logic, 2011, 50(2): 93-105.

DOI：10.1007/s10469-011-9126-9

• Boolean algebra
• computability
• computable model

It is proved that there exists a computable Boolean algebra of elementary characteristics (1, 0, 1) which has a computable set of atoms and a computable Ershov-Tarski ideal, but no strongly computable isomorphic copy. Also a description of Delta(0)(6)-computable Boolean algebras is presented.

• 出版日期2011-5