Hostname: page-component-8448b6f56d-xtgtn Total loading time: 0 Render date: 2024-04-24T07:14:29.521Z Has data issue: false hasContentIssue false
  • English
  • Français

Double jumps of minimal degrees

Published online by Cambridge University Press:  12 March 2014

Carl G. Jockusch Jr  and
David B. Posner
Carl G. Jockusch Jr
Affiliation:
University of Illinois, At Urbana-Champaign, Urbana, Illinois 61801
David B. Posner
Affiliation:
University of Chicago, Chicago, Illinois 60637 San Jose State University, San Jose, CA 95192
Get access Rights & Permissions [Opens in a new window]

Extract

This paper concerns certain relationships between the ordering of degrees of unsolvability and the jump operation. It is shown that every minimal degree a < 0′ satisfies a″ = 0″. To restate this result in more suggestive language and compare it with related results, we shall use notation based on the now standard terminology of “high” and “low” degrees. Let Hn be the class of degrees a < 0′ such that a(n) = 0(n+1), and let Ln be the class of degrees a ≤ 0′ such that an = 0n. (Observe that Hi ⊆ Lj and Li ⊆ Lj, whenever i ≤ j, and Hi ∩ Lj = ∅ for all i andj.) The result mentioned above may now be restated in the form that every minimal degree a ≤ 0′ is in L2. This extends an earlier result of S. B. Cooper ([1], see also [4]) that no minimal degree a < 0′ is in H1. In the other direction, Sasso, Epstein, and Cooper ([10], [15]) have shown that there is a minimal degree a < 0′ which is not in L1. Also, C.E.M. Yates [14, Corollary 11.14], showed the existence of a minimal degree a < 0′ in L1. Thus each minimal degree a < 0′ lies in exactly one of the two classes L1L2 – L1 and each of the classes contains minimal degrees.

Our results are not restricted to the degrees below 0′. We show in fact that every minimal degree a satisfies a″ = (a ∪ 0′)′. To restate this result and discuss extensions of it, we extend the “high-low” classification of degrees from the degrees below 0′ to degrees in general. There are a number of fairly plausible ways of doing this, but we choose the one way we know of doing so which leads to interesting results. Let GHn be the class of degrees a such that a(n) = (a ∪ 0′)(n), and let GLn be the class of degrees a such that a(n) = (a ∪ 0′)(n−1).

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 43 , Issue 4 , December 1978 , pp. 715 - 724
Copyright
Copyright © Association for Symbolic Logic 1978

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

REFERENCES

[1] Cooper, S. B., Minimal degrees and the jump operator, this Journal, vol. 38(1973), pp. 249–271.Google Scholar
[2]Cooper, S. B., Degrees of unsolvability complementary between recursively enumerable degrees, Part 1, Annals of Mathematical Logic, vol. 4 (1972), pp. 31–73.CrossRefGoogle Scholar
[3]Jockusch, C., Degrees of generic sets, Abstract 723-E5, Notices of the American Mathematical Society, vol. 22(1975), p. A–421.Google Scholar
[4]Jockusch, C., Simple proofs of some theorems on high degrees, Canadian Journal of mathematics (to appear).Google Scholar
[5]Jockusch, C. and McLaughlin, T. G., Countable retracing functions and Π20 predicates, Pacific Journal of Mathematics, vol. 30(1969), pp. 67–93.CrossRefGoogle Scholar
[6]Martin, D.A., Classes of recursively enumerable sets and degrees of unsolvability, Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, vol. 12(1966), pp. 295–310.CrossRefGoogle Scholar
[7]Posner, D., High degrees, Doctoral dissertation, University of California, Berkeley, 1977.Google Scholar
[8]Rogers, H., Theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[9]Sacks, G. E., Degrees of unsolvability, Annals of Mathematical Studies, No. 55, Princeton University Press, Princeton, NJ, 1963.Google Scholar
[10]Sasso, L. P., A minimal degree not realizing least possible jump, this Journal, vol. 39(1974), pp. 571–574.Google Scholar
[11]Shoenfield, J. R., On degrees of unsolvability, Annals of Mathematics, vol. 69(1959), pp. 644–653.CrossRefGoogle Scholar
[12]Shoenfield, J. R., Degrees of unsolvability, North-Holland, Amsterdam, 1971.Google Scholar
[13]Simpson, S. G., Minimal covers and hyperdegrees, Transactions of the American Mathematical Society, vol. 209(1975), pp. 45–64.CrossRefGoogle Scholar
[14]Yates, C. E. M., Initial segments of the degrees of unsolvability, Part II: Minimal degrees, this Journal, vol. 35(1970), pp. 243–266.Google Scholar
[15]Yates, C. E. M., Prioric games and minimal degrees below 0(1), Fundamenta Mathematicae, vol. 82(1974), pp. 217–237.CrossRefGoogle Scholar
[16]Yates, C. E. M., Banach-Mazur games, comeager sets and degrees of unsolvability, Mathematical Proceedings of the Cambridge Philosophical Society, vol. 79(1976), pp. 195–220.CrossRefGoogle Scholar