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

Noncappable enumeration degrees below 0e′

Published online by Cambridge University Press:  12 March 2014

S. Barry Cooper
Affiliation:
School of Mathematics, University of Leeds, LS2 9JT, England, E-mail: s.b.cooper@leeds.ac.uk
Andrea Sorbi
Affiliation:
Department of Mathematics, University of Siena, 53100 Siena, Italy, E-mail: sorbi@unisi.it

Abstract

We prove that there exists a noncappable enumeration degree strictly below 0e′.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 1996

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