article · Journal of Symbolic Logic · 2011

On the jump classes of noncuppable enumeration degrees

Cited by 5Abstract and details only

Abstract

Abstract We prove that for every Σ20 enumeration degree b there exists a noncuppable Σ20 degree a > 0e such that and . 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 , that there exist Σ20 noncuppable enumeration degrees at every possible—i.e., above low1—level of the high/low jump hierarchy in the context of .

Cite this paper

APA 7

Harris, C. M. (2011). On the jump classes of noncuppable enumeration degrees. Journal of Symbolic Logic, 76(1), 177–197. https://doi.org/10.2178/jsl/1294170994

MLA 9

Harris, Charles M. “On the jump classes of noncuppable enumeration degrees.” Journal of Symbolic Logic, vol. 76, no. 1, 2011, pp. 177–97, https://doi.org/10.2178/jsl/1294170994.

Chicago

Harris, Charles M. 2011. “On the jump classes of noncuppable enumeration degrees.” Journal of Symbolic Logic 76 (1): 177–97. https://doi.org/10.2178/jsl/1294170994.

Harvard

Harris, C.M. (2011) ‘On the jump classes of noncuppable enumeration degrees’, Journal of Symbolic Logic, 76(1), pp. 177–197. Available at: https://doi.org/10.2178/jsl/1294170994.

BibTeX

@article{harris2011jump,
  title = {{On the jump classes of noncuppable enumeration degrees}},
  author = {Harris, Charles M.},
  journal = {Journal of Symbolic Logic},
  volume = {76},
  number = {1},
  pages = {177--197},
  year = {2011},
  doi = {10.2178/jsl/1294170994}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.