Hostname: page-component-7b7567c8c-w7t8q Total loading time: 0 Render date: 2026-11-18T19:33:23.776Z Has data issue: false hasContentIssue false

Structural properties and Σ20 enumeration degrees

Published online by Cambridge University Press:  12 March 2014

André Nies
Affiliation:
Department of Mathematics, The University of Chicago, Chicago, Illinois 60637-1514, E-mail: nies@math.uchicago.edu
Andrea Sorbi
Affiliation:
Department of Mathematics, University of Siena, 53100 Siena, Italy, E-mail: sorbi@unisi.it

Abstract

We prove that each Σ20 set which is hypersimple relative to ∅′ is noncuppable in the structure of the Σ20 enumeration degrees. This gives a connection between properties of Σ20 sets under inclusion and and the Σ20 enumeration degrees. We also prove that some low non-computably enumerable enumeration degree contains no set which is simple relative to ∅′.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2000

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