Hostname: page-component-7b7567c8c-2n9c9 Total loading time: 0 Render date: 2026-11-16T18:49:43.989Z Has data issue: false hasContentIssue false

Low5 Boolean Subalgebras and Computable Copies

Published online by Cambridge University Press:  12 March 2014

Russell Miller*
Affiliation:
Department of Mathematics, Queens College–C.U.N.Y., 65-30 Kissena Blvd., Flushing, New York 11367, USAPH.D. Programs in Mathematics and Computer Science, C.U.N.Y. Graduate Center, 365 Fifth Avenue, New York, New York 10016, USA, E-mail: Russell.Miller@qc.cuny.edu, URL: www.qc.edu/~rmiller

Abstract

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

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2011

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable