Hostname: page-component-76fb5796d-x4r87 Total loading time: 0 Render date: 2024-04-25T06:57:35.530Z Has data issue: false hasContentIssue false
  • English
  • Français

Uniform upper bounds on ideals of turing degrees1

Published online by Cambridge University Press:  12 March 2014

Harold T. Hodes
Harold T. Hodes*
Affiliation:
Department of Philosophy, Harvard University, Cambridge, Massachusetts 02138 Department of Philosophy, Cornell University, Ithaca, New York 14850
Get access Rights & Permissions [Opens in a new window]

Extract

Given I, a reasonable countable set of Turing degrees, can we find some sort of canonical strict upper bound on I? If I = {a ∣ a ≤ b}, the upper bound on I which springs to mind is b′. But what if I is closed under jump? This question arises naturally out of the question which motivates a large part of hierarchy theory: Is there a canonical increasing function from a countable ordinal, preferably a large one, into D, the set of Turing degrees? If d is to be such a function, it is natural to require that d(α + 1) = d(α)′; but how should d(λ) depend on d ↾ λ, where λ is a limit ordinal?

For any I ⊆ D, let MI, = ⋃I. Towards making the above questions precise, we introduce ideals of Turing degrees.

Definition 1. I ⊆ D is an ideal iff I is closed under jump and join, and I is downward-closed, i.e., if a ≤ b & b ϵ I then a ϵ I.

The following definition reflects the hierarchy-theoretic motivation for this paper.

Definition 2. For I ⊆ D and A ⊆ ω, I is an A-hierarchy ideal iff for some countable ordinal α, MI = Lα[A]∩ ωω.

All hierarchy ideals are ideals, but not conversely.

Early in the game Spector knocked out the best sort of canonicity for upper bounds on ideals, proving that no set of degrees closed under jump has a least upper bound.

Type
Research Article
Information
The Journal of Symbolic Logic , Volume 43 , Issue 3 , September 1978 , pp. 601 - 612
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.)

Footnotes

1

Theorem 1, (1) ⇔ (2), and Theorem 2, (1*) ⇔ (2*), and possibly several other results reported here were obtained independently by Saul Kripke. Thanks to Andreas Blass, George Boolos, Carl Jockusch, Hilary Putnam and Steve Simpson for suggestions and encouragement.

References

BIBLIOGRAPHY

[1]Boyd, R., Hensel, G. and Putnam, H., A recursion-theoretic characterization of the Ramified Analytical Hierarchy, Transactions,of the American Mathematical Society, vol. 141 (1969), pp. 37–62.CrossRefGoogle Scholar
[2]Hensel, G. and Putnam, H., On the notational independence of various hierarchies of degrees of unsolvability, this Journal, vol. 30 (1965), pp. 64–86.Google Scholar
[3]Jockusch, C. and Simpson, S., A degree-theoretic characterization of the Ramified Analytical Hierarchy, Annals of Mathematical Logic, vol. 10 (1976), pp. 1–32.CrossRefGoogle Scholar
[4]Leeds, S. and Putnam, H., An intrinsic characterization of the hierarchy of the constructible sets of integers, Logic Colloquium '69, North-Holland, Amsterdam.Google Scholar
[5]Rogers, H., The theory of recursive functions and effective computability, McGraw-Hill, New York, 1967.Google Scholar
[6]Shoenfield, J., Mathematical logic, Addison-Wesley, Reading, Massachusetts, 1967.Google Scholar