Cupping and jump classes in the computably enumerable degrees
We show that there is a cuppable c.e. degree, all of whose cupping partners are high. In particular, not all cuppable degrees are -cuppable, or indeed 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...
Saved in:
Main Authors: | Greenberg, Noam, Ng, Keng Meng, Wu, Guohua |
---|---|
其他作者: | School of Physical and Mathematical Sciences |
格式: | Article |
語言: | English |
出版: |
2022
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/154823 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
機構: | Nanyang Technological University |
語言: | English |
相似書籍
-
Bounding computably enumerable degrees in the Ershov hierarchy
由: Li, A., et al.
出版: (2014) -
On the C.E. degrees realizable in II⁰₁ classes
由: Csima, Barbara F., et al.
出版: (2023) -
A join theorem for the computably enumerable degrees
由: Jockusch Jr., C.G., et al.
出版: (2014) -
Cupping in the computably enumerable degrees
由: Tran, Hong Hanh
出版: (2023) -
Reducibilities among equivalence relations induced by recursively enumerable structures
由: Gavryushkin A., et al.
出版: (2020)