Jumping to a Uniform Upper Bound

Proceedings of the American Mathematical Society 85 (4):600-602 (1982)
  Copy   BIBTEX

Abstract

A uniform upper bound on a class of Turing degrees is the Turing degree of a function which parametrizes the collection of all functions whose degree is in the given class. I prove that if a is a uniform upper bound on an ideal of degrees then a is the jump of a degree c with this additional property: there is a uniform bound b<a so that b V c < a.

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,423

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2012-01-01

Downloads
30 (#758,519)

6 months
5 (#1,067,832)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Harold Hodes
Cornell University

Citations of this work

Upper bounds for the arithmetical degrees.M. Lerman - 1985 - Annals of Pure and Applied Logic 29 (3):225-254.

Add more citations

References found in this work

No references found.

Add more references