More about uniform upper Bounds on ideals of Turing degrees

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


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

Author's Profile

Harold Hodes
Cornell University


Added to PP

397 (#32,408)

6 months
58 (#50,051)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?