Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-15T05:39:45.091Z Has data issue: false hasContentIssue false

The -spectrum of a linear order

Published online by Cambridge University Press:  12 March 2014

Russell Miller*
Affiliation:
Department of Mathematics, Cornell University, Ithaca, NY 14853, USA, E-mail: russell@math.cornell.edu

Abstract

Slaman and Wehner have constructed structures which distinguish the computable Turing degree 0 from the noncomputable degrees, in the sense that the spectrum of each structure consists precisely of the noncomputable degrees. Downey has asked if this can be done for an ordinary type of structure such as a linear order. We show that there exists a linear order whose spectrum includes every noncomputable degree, but not 0. Since our argument requires the technique of permitting below a set, we include a detailed explantion of the mechanics and intuition behind this type of permitting.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2001

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