Jump Theorems for REA Operators

Mathematical Logic Quarterly 39 (1):1-6 (1993)
  Copy   BIBTEX

Abstract

In [2], Jockusch and Shore have introduced a new hierarchy of sets and operators called the REA hierarchy. In this note we prove analogues of the Friedberg Jump Theorem and the Sacks Jump Theorem for many REA operators. MSC: 03D25, 03D55

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

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

Through your library

Similar books and articles

A jump inversion theorem for the enumeration jump.I. N. Soskov - 2000 - Archive for Mathematical Logic 39 (6):417-437.
Isolation and the Jump Operator.Guohua Wu - 2001 - Mathematical Logic Quarterly 47 (4):525-534.
On the jump classes of noncuppable enumeration degrees.Charles M. Harris - 2011 - Journal of Symbolic Logic 76 (1):177 - 197.
The jump operation for structure degrees.V. Baleva - 2005 - Archive for Mathematical Logic 45 (3):249-265.
Badness and jump inversion in the enumeration degrees.Charles M. Harris - 2012 - Archive for Mathematical Logic 51 (3-4):373-406.
Splitting theorems and the jump operator.R. G. Downey & Richard A. Shore - 1998 - Annals of Pure and Applied Logic 94 (1-3):45-52.
A non-inversion theorem for the jump operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.
A jump operator on honest subrecursive degrees.Lars Kristiansen - 1998 - Archive for Mathematical Logic 37 (2):105-125.
Embedding jump upper semilattices into the Turing degrees.Antonio Montalbán - 2003 - Journal of Symbolic Logic 68 (3):989-1014.

Analytics

Added to PP
2013-12-01

Downloads
14 (#968,362)

6 months
2 (#1,240,909)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.

Add more references