Low₅ Boolean subalgebras and computable copies

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

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

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,667

External links

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

Through your library

Similar books and articles

Boolean algebras in ast.Klaus Schumacher - 1992 - Mathematical Logic Quarterly 38 (1):373-382.
Low n Boolean subalgebras.Rebecca M. Steiner - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 696--702.
Categoricity Spectra for Polymodal Algebras.Nikolay Bazhenov - 2016 - Studia Logica 104 (6):1083-1097.
A Boolean model of ultrafilters.Thierry Coquand - 1999 - Annals of Pure and Applied Logic 99 (1-3):231-239.
Special subalgebras of Boolean algebras.J. Donald Monk - 2010 - Mathematical Logic Quarterly 56 (2):148-158.
Degree spectra of intrinsically C.e. Relations.Denis Hirschfeldt - 2001 - Journal of Symbolic Logic 66 (2):441-469.

Analytics

Added to PP
2013-09-30

Downloads
50 (#441,015)

6 months
9 (#504,609)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

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 Knight & Michael Stob - 2000 - Journal of Symbolic Logic 65 (4):1605-1623.

Add more references