Cupping and diamond embeddings: a unifying approach

Authors:
Chengling Fang;Jiang Liu;Guohua Wu
Affiliations:
School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore;State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing, Peoples' Republic of China;School of Physical and Mathematical Sciences, Nanyang Technological University, Singapore
Venue:
CiE'11 Proceedings of the 7th conference on Models of computation in context: computability in Europe
Year:
2011

Recursively enumerable sets and degrees

Recursively enumerable sets and degrees
Degrees with almost universal cupping property

CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
Universal cupping degrees

TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation

Hi-index	0.00

In this paper, we prove that for any nonzero cappable degree c, there is a d.c.e. degree d and a c.e. degree b