Hostname: page-component-7b7567c8c-wxvwp Total loading time: 0 Render date: 2026-11-17T23:13:20.531Z Has data issue: false hasContentIssue false

Bounding nonsplitting enumeration degrees

Published online by Cambridge University Press:  12 March 2014

Thomas F. Kent
Affiliation:
Dipartimento di Scienze Matematiche ed Informatiche, “Roberto Magari”, Pian Dei Mantellini 44, 53100 Siena, Italy. E-mail: kent@unisi.it
Andrea Sorbi
Affiliation:
Dipartimento di Scienze Matematiche ed Informatiche, “Roberto Magari”, Pian Dei Mantellini 44, 53100 Siena, Italy. E-mail: sorbi@unisi.it

Abstract

We show that every nonzero enumeration degree bounds a nonsplitting nonzero enumeration degree.

Information

Type
Research Article
Copyright
Copyright © Association for Symbolic Logic 2007

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