Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T10:17:39.383Z Has data issue: false hasContentIssue false

CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES

Published online by Cambridge University Press:  30 October 2020

NOAM GREENBERG
Affiliation:
SCHOOL OF MATHEMATICS AND STATISTICS VICTORIA UNIVERSITY OF WELLINGTON WELLINGTON, NEW ZEALAND E-mail: greenberg@msor.vuw.ac.nz
KENG MENG NG
Affiliation:
DIVISION OF MATHEMATICAL SCIENCES SCHOOL OF PHYSICAL AND MATHEMATICAL SCIENCES NANYANG TECHNOLOGICAL UNIVERSITY SINGAPORE 637371, SINGAPORE E-mail: kmng@ntu.edu.sg E-mail: guohua@ntu.edu.sg
GUOHUA WU
Affiliation:
DIVISION OF MATHEMATICAL SCIENCES SCHOOL OF PHYSICAL AND MATHEMATICAL SCIENCES NANYANG TECHNOLOGICAL UNIVERSITY SINGAPORE 637371, SINGAPORE E-mail: kmng@ntu.edu.sg E-mail: guohua@ntu.edu.sg
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.

We show that there is a cuppable c.e. degree, all of whose cupping partners are high. In particular, not all cuppable degrees are ${\operatorname {\mathrm {low}}}_3$-cuppable, or indeed ${\operatorname {\mathrm {low}}}_n$ cuppable for any n, refuting a conjecture by Li. On the other hand, we show that one cannot improve highness to superhighness. We also show that the ${\operatorname {\mathrm {low}}}_2$-cuppable degrees coincide with the array computable-cuppable degrees, giving a full understanding of the latter class.

Information

Type
Articles
Copyright
© The Association for Symbolic Logic 2020