Hostname: page-component-7b7567c8c-9cwtv Total loading time: 0 Render date: 2026-11-19T09:32:02.936Z Has data issue: false hasContentIssue false

INITIAL SEGMENTS OF THE ${\rm{\Sigma }}_2^0 $ ENUMERATION DEGREES

Published online by Cambridge University Press:  09 March 2016

HRISTO GANCHEV
Affiliation:
FACULTY OF MATHEMATICS AND INFORMATICS SOFIA UNIVERSITY 1164 SOFIA, BULGARIAE-mail: ganchev@fmi.uni-sofia.bg
ANDREA SORBI
Affiliation:
DIPARTIMENTO DI INGEGNERIA DELL’INFORMAZIONE E SCIENZE MATEMATICHE UNIVERSITÀ DEGLI STUDI DI SIENA I-53100 SIENA, ITALYE-mail: andrea.sorbi@unisi.it
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Using properties of ${\cal K}$-pairs of sets, we show that every nonzero enumeration degree a bounds a nontrivial initial segment of enumeration degrees whose nonzero elements have all the same jump as a. Some consequences of this fact are derived, that hold in the local structure of the enumeration degrees, including: There is an initial segment of enumeration degrees, whose nonzero elements are all high; there is a nonsplitting high enumeration degree; every noncappable enumeration degree is high; every nonzero low enumeration degree can be capped by degrees of any possible local jump (i.e., any jump that can be realized by enumeration degrees of the local structure); every enumeration degree that bounds a nonzero element of strictly smaller jump, is bounding; every low enumeration degree below a non low enumeration degree a can be capped below a.

Information

Type
Articles
Copyright
Copyright © The Association for Symbolic Logic 2016