Switch to: Citations

Add references

You must login to add references.
  1. (1 other version)Anti‐Mitotic Recursively Enumerable Sets.Klaus Ambos-Spies - 1985 - Mathematical Logic Quarterly 31 (29-30):461-477.
    Download  
     
    Export citation  
     
    Bookmark   11 citations  
  • (1 other version)Completely Autoreducible Degrees.Carl G. Jockusch & Michael S. Paterson - 1976 - Mathematical Logic Quarterly 22 (1):571-575.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Review: B. A. Trahtenbrot, On Autoreducibility. [REVIEW]Richard E. Ladner - 1973 - Journal of Symbolic Logic 38 (3):527-527.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)Anti‐Mitotic Recursively Enumerable Sets.Klaus Ambos-Spies - 1985 - Mathematical Logic Quarterly 31 (29-30):461-477.
    Download  
     
    Export citation  
     
    Bookmark   10 citations  
  • Computational complexity, speedable and levelable sets.Robert I. Soare - 1977 - Journal of Symbolic Logic 42 (4):545-563.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • Splitting properties of R. E. sets and degrees.R. G. Downey & L. V. Welch - 1986 - Journal of Symbolic Logic 51 (1):88-109.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • (1 other version)The Priority Method I.A. H. Lachlans - 1967 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 13 (1-2):1-10.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • (1 other version)Completely Autoreducible Degrees.Carl G. Jockusch & Michael S. Paterson - 1976 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 22 (1):571-575.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • (1 other version)The Priority Method I.A. H. Lachlans - 1967 - Mathematical Logic Quarterly 13 (1‐2):1-10.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Degree theoretical splitting properties of recursively enumerable sets.Klaus Ambos-Spies & Peter A. Fejer - 1988 - Journal of Symbolic Logic 53 (4):1110-1137.
    A recursively enumerable splitting of an r.e. setAis a pair of r.e. setsBandCsuch thatA=B∪CandB∩C= ⊘. Since for such a splitting degA= degB∪ degC, r.e. splittings proved to be a quite useful notion for investigations into the structure of the r.e. degrees. Important splitting theorems, like Sacks splitting [S1], Robinson splitting [R1] and Lachlan splitting [L3], use r.e. splittings.Since each r.e. splitting of a set induces a splitting of its degree, it is natural to study the relation between the degrees of (...)
    Download  
     
    Export citation  
     
    Bookmark   7 citations  
  • A non-inversion theorem for the jump operator.Richard A. Shore - 1988 - Annals of Pure and Applied Logic 40 (3):277-303.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Gerald E. Sacks. The recursively enumerable degrees are dense. Annals of mathematics, ser. 2 vol. 80 (1964), pp. 300–312. [REVIEW]Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):294-295.
    Download  
     
    Export citation  
     
    Bookmark   38 citations  
  • The universal splitting property. II.M. Lerman & J. B. Remmel - 1984 - Journal of Symbolic Logic 49 (1):137-150.
    Download  
     
    Export citation  
     
    Bookmark   8 citations  
  • Mitotic recursively enumerable sets.Richard E. Ladner - 1973 - Journal of Symbolic Logic 38 (2):199-211.
    Download  
     
    Export citation  
     
    Bookmark   10 citations