Switch to: Citations

Add references

You must login to add references.
  1. A minimal pair of recursively enumerable degrees.C. E. M. Yates - 1966 - Journal of Symbolic Logic 31 (2):159-168.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • 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  
  • (2 other versions)Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Mathematical Logic Quarterly 5 (7‐13):117-125.
    Download  
     
    Export citation  
     
    Bookmark   41 citations  
  • (1 other version)The impossibility of finding relative complements for recursively enumerable degrees.A. H. Lachlan - 1966 - Journal of Symbolic Logic 31 (3):434-454.
    Download  
     
    Export citation  
     
    Bookmark   5 citations  
  • Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.
    A classic treatment of degrees of unsolvability from the acclaimed Annals of Mathematics Studies series Princeton University Press is proud to have published the Annals of Mathematics Studies since 1940. One of the oldest and most respected series in science publishing, it has included many of the most important and influential mathematical works of the twentieth century. The series continues this tradition as Princeton University Press publishes the major works of the twenty-first century. To mark the continued success of the (...)
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • Degrees of unsolvability.Joseph Robert Shoenfield - 1971 - New York,: American Elsevier.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • (1 other version)Review: A. H. Lachlan, Lower Bounds for Pairs of Recursively Enumerable Degrees. [REVIEW]Carl G. Jockusch - 1972 - Journal of Symbolic Logic 37 (3):611-611.
    Download  
     
    Export citation  
     
    Bookmark   29 citations  
  • (2 other versions)Reducibility and Completeness for Sets of Integers.Richard M. Friedberg & Hartley Rogers - 1959 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (7-13):117-125.
    Download  
     
    Export citation  
     
    Bookmark   43 citations  
  • Recursively Enumerable Sets and Retracting Functions.C. E. M. Yates - 1967 - Journal of Symbolic Logic 32 (3):394-394.
    Download  
     
    Export citation  
     
    Bookmark   6 citations