Switch to: Citations

Add references

You must login to add references.
  1. A Recursively Enumerable Degree Which Will Not Split Over All Lesser Ones.Alistair H. Lachlan - 1976 - Annals of Mathematical Logic 9 (4):307.
  • Trial and Error Predicates and the Solution to a Problem of Mostowski.Hilary Putnam - 1965 - Journal of Symbolic Logic 30 (1):49-57.
  • Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion.C. G. Jockusch, M. Lerman, R. I. Soare & R. M. Solovay - 1989 - Journal of Symbolic Logic 54 (4):1288-1323.
  • The Recursively Enumerable Degrees Are Dense.Gerald E. Sacks - 1969 - Journal of Symbolic Logic 34 (2):294-295.
  • Lower Bounds for Pairs of Recursively Enumerable Degrees.[author unknown] - 1972 - Journal of Symbolic Logic 37 (3):611-611.
     
    Export citation  
     
    Bookmark   41 citations