A cohesive set which is not high

Mathematical Logic Quarterly 39 (1):515-530 (1993)


We study the degrees of unsolvability of sets which are cohesive . We answer a question raised by the first author in 1972 by showing that there is a cohesive set A whose degree a satisfies a' = 0″ and hence is not high. We characterize the jumps of the degrees of r-cohesive sets, and we show that the degrees of r-cohesive sets coincide with those of the cohesive sets. We obtain analogous results for strongly hyperimmune and strongly hyperhyperimmune sets in place of r-cohesive and cohesive sets, respectively. We show that every strongly hyperimmune set whose degree contains either a Boolean combination of ∑2 sets or a 1-generic set is of high degree. We also study primitive recursive analogues of these notions and in this case we characterize the corresponding degrees exactly. MSC: 03D30, 03D55

Download options


    Upload a copy of this work     Papers currently archived: 72,694

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library


Added to PP

21 (#539,912)

6 months
2 (#259,476)

Historical graph of downloads
How can I increase my downloads?

References found in this work

Classical Recursion Theory: The Theory of Functions and Sets of Natural Numbers.Piergiorgio Odifreddi - 1989 - Sole Distributors for the Usa and Canada, Elsevier Science Pub. Co..
Classical Recursion Theory.Peter G. Hinman - 2001 - Bulletin of Symbolic Logic 7 (1):71-73.

Add more references

Citations of this work

Ramsey's Theorem and Cone Avoidance.Damir Dzhafarov & Carl Jockusch Jr - 2009 - Journal of Symbolic Logic 74 (2):557 - 578.
Cohesive Sets and Rainbows.Wei Wang - 2014 - Annals of Pure and Applied Logic 165 (2):389-408.
Reverse Mathematics and a Ramsey-Type König's Lemma.Stephen Flood - 2012 - Journal of Symbolic Logic 77 (4):1272-1280.

View all 24 citations / Add more citations

Similar books and articles