Low₅ Boolean subalgebras and computable copies

Journal of Symbolic Logic 76 (3):1061 - 1074 (2011)

Abstract

It is known that the spectrum of a Boolean algebra cannot contain a low₄ degree unless it also contains the degree 0; it remains open whether the same holds for low₅ degrees. We address the question differently, by considering Boolean subalgebras of the computable atomless Boolean algebra B. For such subalgebras A, we show that it is possible for the spectrum of the unary relation A on B to contain a low₅ degree without containing 0

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,743

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2013-09-30

Downloads
35 (#329,821)

6 months
1 (#386,989)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Recursive Isomorphism Types of Recursive Boolean Algebras.J. B. Remmel - 1981 - Journal of Symbolic Logic 46 (3):572-594.
Computable Boolean Algebras.Julia F. Knight & Michael Stob - 2000 - Journal of Symbolic Logic 65 (4):1605-1623.

Add more references

Citations of this work

No citations found.

Add more citations