Archive for Mathematical Logic

, Volume 33, Issue 2, pp 121–129

Recursive and r.e. quotient Boolean algebras


  • John J. Thurber
    • Department of MathematicsUniversity of Notre Dame

DOI: 10.1007/BF01352933

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.

Copyright information

© Springer-Verlag 1994