More about uniform upper Bounds on ideals of Turing degrees

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

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

Analytics

Added to PP
2009-01-28

Downloads
447 (#38,014)

6 months
88 (#41,705)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Harold Hodes
Cornell University

Citations of this work

No citations found.

Add more citations

References found in this work

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

Add more references