Recursive and r.e. quotient Boolean algebras
- Cite this article as:
- Thurber, J.J. Arch Math Logic (1994) 33: 121. doi:10.1007/BF01352933
We prove a converse to one of the theorems from [F], giving a description in terms of Turing complexity of sets which can be coded into recursive and r.e. quotient Boolean algebras.