March 2011 On the jump classes of noncuppable enumeration degrees
Charles M. Harris
J. Symbolic Logic 76(1): 177-197 (March 2011). DOI: 10.2178/jsl/1294170994

Abstract

We prove that for every Σ02 enumeration degree b there exists a noncuppable Σ02 degree a > 0e such that b'c a' and a''c b''. This allows us to deduce, from results on the high/low jump hierarchy in the local Turing degrees and the jump preserving properties of the standard embedding ι : 𝒟T → 𝒟e, that there exist Σ02 noncuppable enumeration degrees at every possible—i.e., above low1—level of the high/low jump hierarchy in the context of 𝒟e.

Citation

Download Citation

Charles M. Harris. "On the jump classes of noncuppable enumeration degrees." J. Symbolic Logic 76 (1) 177 - 197, March 2011. https://doi.org/10.2178/jsl/1294170994

Information

Published: March 2011
First available in Project Euclid: 4 January 2011

zbMATH: 1215.03056
MathSciNet: MR2791342
Digital Object Identifier: 10.2178/jsl/1294170994

Rights: Copyright © 2011 Association for Symbolic Logic

JOURNAL ARTICLE
21 PAGES

This article is only available to subscribers.
It is not available for individual sale.
+ SAVE TO MY LIBRARY

Vol.76 • No. 1 • March 2011
Back to Top