Skip to main content Accessibility help

A hierarchy for the plus cupping Turing degrees

  • Yong Wang (a1) and Angsheng Li (a2) (a3)


We say that a computably enumerable (c. e.) degree a is plus-cupping, if for every c.e. degree x with 0 < xa, there is a c. e. degree y0′ such that xy = 0′. We say that a is n-plus-cupping, if for every c. e. degree x, if 0 < xa, then there is a low n c. e. degree I such that xI = 0′. Let PC and PC n be the set of all plus-cupping, and n-plus-cupping c. e. degrees respectively. Then PC 1PC 2PC 3 = PC. In this paper we show that PC 1PC 2, so giving a nontrivial hierarchy for the plus cupping degrees. The theorem also extends the result of Li, Wu and Zhang [14] showing that LC 1LC 2, as well as extending the Harrington plus-cupping theorem [8].



Hide All
[1] Ambos-Spies, K., Jockusch, C. G. Jr., Shore, R. A., and Soare, R. I., An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees, Transactions of the American Mathematical Society, vol. 281 (1984), pp. 109128.
[2] Cholak, P., Groszek, M., and Slaman, T. A., An almost deep degree, this Journal, vol. 66 (2001), no. 2, pp. 881901.
[3] Cooper, S. B., Distinguishing the arithmetical hierarchy, preprint, Berkeley, 10 1972.
[4] Cooper, S. B., On a theorem of C. E. M. Yates, handwritten notes, 1974.
[5] Cooper, S. B. and Li, A., Splitting and nonsplitting, II: A Low2 computably enumerable degree above which 0′ is not splittable, this Journal, vol. 67 (2002), no. 4, pp. 13911430.
[6] Fejer, P. A. and Soare, R. I., The plus cupping theorem for the recursively enumerable degrees. Logic year 1979–80: University of Connecticut (Lerman, M., Schmerl, J. H., and Soare, R. I., editors), Lecture Notes in Mathematics, vol. 859, Springer-Verlag, Berlin, Heidelberg, Tokyo, New York, 1981.
[7] Harrington, L., On Cooper's proof of a theorem of Yates, handwritten notes, 1976.
[8] Harrington, L., Plus cupping in the recursively enumerable degrees, handwritten notes, 1978.
[9] Jockusch, C. G., Li, A., and Yang, Y., A join theorem for the computably enumerable degrees, to appear.
[10] Lachlan, A. H., Lower bounds for pairs of recursively enumerable degrees, Proceedings of the London Mathematical Society, vol. 16 (1966), pp. 537569.
[11] Lachlan, A. H., Bounding minimal pairs, this Journal, vol. 44 (1979), pp. 626642.
[12] Li, A., Elementary differences among jump hierarchies, to appear.
[13] Li, A., A hierarchy characterisation of the cuppable degrees, to appear.
[14] Li, A., Wu, G., and Zhang, Z., A hierarchy for the cuppable degrees, Illinois Journal of Mathematics, vol. 44 (Fall 2000), no. 3, pp. 619632.
[15] Robinson, R. W., Jump restricted interpolation in the recursively enumerable degrees, Annals of Mathematics, vol. 93 (1971), no. 2, pp. 586596.
[16] Sacks, G. E., On the degrees less than 0′, Annals of Mathematics, vol. 77 (1963), no. 2, pp. 211231.
[17] Sacks, G. E., The recursively enumerable degrees are dense, Annals of Mathematics, vol. 80 (1964), no. 2, pp. 300312.
[18] Soare, R. I., Automorphisms of the lattice of recursively enumerable sets, Bulletin of the American Mathematical Society, vol. 80 (1974), pp. 5358.
[19] Soare, R. I., Recursively enumerable sets and degrees, Springer-Verlag, Berlin, Heidelberg, New York, London, Paris, Tokyo, 1987.
[20] Yates, C. E. M., A minimal pair of recursively enumerable degrees, this Journal, vol. 31 (1966), pp. 159168.

Related content

Powered by UNSILO

A hierarchy for the plus cupping Turing degrees

  • Yong Wang (a1) and Angsheng Li (a2) (a3)


Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed.