Cupping and jump classes in the computably enumerable degrees

• المؤلفون الرئيسيون: Greenberg, Noam, Ng, Keng Meng, Wu, Guohua
• مؤلفون آخرون: School of Physical and Mathematical Sciences
• التنسيق: مقال
• اللغة: English
• منشور في: 2022
• الموضوعات: Science::Mathematics; Array Computable; Computably Enumerable Degrees
• الوصول للمادة أونلاين: https://hdl.handle.net/10356/154823
• المؤسسة: Nanyang Technological University

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...