Journal of Mathematical Logic 10 (1):83-99 (2010)

In this paper, we solve a long-standing open question, about the spectrum of the successivity relation on a computable linear ordering. We show that if a computable linear ordering [Formula: see text] has infinitely many successivities, then the spectrum of the successivity relation is closed upwards in the computably enumerable Turing degrees. To do this, we use a new method of constructing [Formula: see text]-isomorphisms, which has already found other applications such as Downey, Kastermans and Lempp [9] and is of independent interest. It would seem to promise many further applications.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1142/S0219061310000924
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 54,740
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

Degrees Coded in Jumps of Orderings.Julia F. Knight - 1986 - Journal of Symbolic Logic 51 (4):1034-1042.

View all 15 references / Add more references

Citations of this work BETA

Add more citations

Similar books and articles


Added to PP index

Total views
28 ( #363,195 of 2,386,732 )

Recent downloads (6 months)
1 ( #550,981 of 2,386,732 )

How can I increase my downloads?


My notes