04035813

j

04035813 Odintsov, S.P. Lattice of recursively enumerable subalgebras of a recursive Boolean algebra. Algebra Logika 25, No.6, 631-642 (1986). 1986 Sibirskii Fond Algebry i Logiki, Novosibirsk; Institut Diskretnoi Matematiki i Informatiki, Novosibirsk RU lattice of recursively enumerable subalgebras recursive Boolean algebra Turing degrees The lattice of recursively enumerable subalgebras of a recursive Boolean algebra is studied. Main result: every recursive Boolean algebra B has a recursive subalgebra C such that the lattice of recursively enumerable subalgebras containing C is isomorphic to the lattice ${\cal E}$ of recursively enumerable sets. The isomorphism preserves Turing degrees. Using this result the author transfers some results known for ${\cal E}$ to lattices of recursively enumerable subalgebras of recursively Boolean algebras. O.V.Belegradek