Journal of Symbolic Logic 48 (2):441-457 (1983)

Authors
Harold Hodes
Cornell University
Abstract
Let I be a countable jump ideal in $\mathscr{D} = \langle \text{The Turing degrees}, \leq\rangle$ . The central theorem of this paper is: a is a uniform upper bound on I iff a computes the join of an I-exact pair whose double jump a (1) computes. We may replace "the join of an I-exact pair" in the above theorem by "a weak uniform upper bound on I". We also answer two minimality questions: the class of uniform upper bounds on I never has a minimal member; if ∪ I = L α [ A] ∩ ω ω for α admissible or a limit of admissibles, the same holds for nice uniform upper bounds. The central technique used in proving these theorems consists in this: by trial and error construct a generic sequence approximating the desired object; simultaneously settle definitely on finite pieces of that object; make sure that the guessing settles down to the object determined by the limit of these finite pieces
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.2307/2273561
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

References found in this work BETA

Uniform Upper Bounds on Ideals of Turing Degrees.Harold T. Hodes - 1978 - Journal of Symbolic Logic 43 (3):601-612.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
243 ( #45,376 of 2,504,848 )

Recent downloads (6 months)
19 ( #45,960 of 2,504,848 )

How can I increase my downloads?

Downloads

My notes