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

A set with barely degree

Published online by Cambridge University Press:  12 March 2014

Rod Downey
Affiliation:
School of Mathematical and Computer Sciences, Victoria University, Po Box 600, Wellington, New Zealand, E-mail: rod.downey@vuw.ac.nz
Geoffrey Laforte
Affiliation:
Institute For Human and Machine Cognition, 11000 University Parkway, Pensacola. FL 32514, USA, E-mail: glaforte@ai.uwf.edu
Steffen Lempp
Affiliation:
Department of Mathematics, University of Wisconsin, 480 Lincoln Drive, Madison, WI 53706-1388, USA, E-mail: lempp@math.wisc.edu

Abstract

We construct a degree which fails to be computably enumerable in any computably enumerable set strictly below .

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1999

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