Universal recursively enumerable Boolean algebras (Q800916)

Let \({\mathfrak K}\) be a class of r.e. Boolean algebras. A r.e. Boolean algebra \({\mathfrak A}_{\nu}\) is called universal in the class \({\mathfrak K}\), if \({\mathfrak A}_{\nu}\in {\mathfrak K}\) and for each r.e. Boolean algebra \({\mathfrak B}_{\mu}\in {\mathfrak K}\) there exists a r.e. Boolean algebra \({\mathfrak C}_{\pi}\) such that \({\mathfrak B}_{\mu}\times {\mathfrak C}_{\pi}\) and \({\mathfrak A}_{\nu}\) are recursively isomorphic. Let B denote the class of atomless r.e. Boolean algebras, A be the class of atomic r.e. Boolean algebras and \(A_ r\) be the class of atomic recursive Boolean algebras. The author studies the question of existence of universal r.e. Boolean algebras for the classes B, A, \(A_ r\) and proves the following theorems: Theorem 1. There is no universal r.e. Boolean algebra in the class B of atomless r.e. Boolean algebras. Theorem 2. For each atomic r.e. Boolean algebra (\({\mathfrak A},\mu)\) there exists a recursive atomic Boolean algebra which is not a direct summand in (\({\mathfrak A},\mu)\). Corollary 1. The class \(A_ r\) has no universal recursive Boolean algebra. Corollary 2. The class A has no universal r.e. Boolean algebra.