Recursive and r.e. quotient Boolean algebras
- 21 Downloads
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.
Unable to display preview. Download preview PDF.
© Springer-Verlag 1994