Switch to: Citations

Add references

You must login to add references.
  1. Automorphisms of the Lattice of Recursively Enumerable Sets. Part II: Low Sets.Robert I. Soare - 1982 - Annals of Pure and Applied Logic 22 (1):69.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   10 citations  
  • A Recursively Enumerable Degree Which Will Not Split Over All Lesser Ones.Alistair H. Lachlan - 1976 - Annals of Pure and Applied Logic 9 (4):307.
  • The Intervals of the Lattice of Recursively Enumerable Sets Determined by Major Subsets.Wolfgang Maass & Michael Stob - 1983 - Annals of Pure and Applied Logic 24 (2):189-212.
  • Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.
    Direct download  
     
    Export citation  
     
    Bookmark   517 citations