Switch to: References

Add citations

You must login to add citations.
  1. On the definability of the double jump in the computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2002 - Journal of Mathematical Logic 2 (02):261-296.
    We show that the double jump is definable in the computably enumerable sets. Our main result is as follows: let [Formula: see text] is the Turing degree of a [Formula: see text] set J ≥T0″}. Let [Formula: see text] such that [Formula: see text] is upward closed in [Formula: see text]. Then there is an ℒ property [Formula: see text] such that [Formula: see text] if and only if there is an A where A ≡T F and [Formula: see text]. (...)
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • (1 other version)Some orbits for.Peter Cholak, Rod Downey & Eberhard Herrmann - 2001 - Annals of Pure and Applied Logic 107 (1-3):193-226.
    In this article we establish the existence of a number of new orbits in the automorphism group of the computably enumerable sets. The degree theoretical aspects of these orbits also are examined.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • (1 other version)Hyperhypersimple α-r.e. sets.C. T. Chong & M. Lerman - 1976 - Annals of Mathematical Logic 9 (1-2):1-48.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • On elementary theories of some lattices or α-recursively enumerable sets.Mannel Lerman - 1978 - Annals of Mathematical Logic 14 (3):227-272.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • (1 other version)Some orbits for E.Peter Cholak, Rod Downey & Eberhard Herrmann - 2001 - Annals of Pure and Applied Logic 107 (1-3):193-226.
    In this article we establish the existence of a number of new orbits in the automorphism group of the computably enumerable sets. The degree theoretical aspects of these orbits also are examined.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Maximal alpha-r.e. sets and their complements.Anne Leggett - 1974 - Annals of Mathematical Logic 6 (3/4):293.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
    A splitting of an r.e. set A is a pair A1, A2 of disjoint r.e. sets such that A1 A2 = A. Theorems about splittings have played an important role in recursion theory. One of the main reasons for this is that a splitting of A is a decomposition of A in both the lattice, , of recursively enumerable sets and in the uppersemilattice, R, of recursively enumerable degrees . Thus splitting theor ems have been used to obtain results about (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • (1 other version)A Dichotomy of the Recursively Enumerable Sets.Robert W. Robinson - 1968 - Mathematical Logic Quarterly 14 (21-24):339-356.
    Download  
     
    Export citation  
     
    Bookmark   10 citations