Title

Degree Spectra of the Successor Relation of Computable Linear Orderings

Authors

Jennifer Chubb, University of San FranciscoFollow
Andrey Frolov
Valentina Harizanov

Document Type

Article

Publication Date

2009

Abstract

We establish that for every computably enumerable (c.e.) Turing degree b, the upper cone of c.e. Turing degrees determined by b is the degree spectrum of the successor relation of some computable linear ordering. This follows from our main result, that for a large class of linear orderings, the degree spectrum of the successor relation is closed upward in the c.e. Turing degrees.

Comments

Preprint. Article published in Archive for Mathematical Logic Volume 48, Number 1, 7-13.

DOI: 10.1007/s00153-008-0110-6

Recommended Citation

Chubb, Jennifer; Frolov, Andrey; and Harizanov, Valentina, "Degree Spectra of the Successor Relation of Computable Linear Orderings" (2009). Mathematics. 5.
https://repository.usfca.edu/math/5