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.
    Download  
     
    Export citation  
     
    Bookmark   39 citations  
  • 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 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  
  • A metatheorem for constructions by finitely many workers.J. F. Knight - 1990 - Journal of Symbolic Logic 55 (2):787-804.
    Download  
     
    Export citation  
     
    Bookmark   6 citations  
  • Recursively Enumerable Sets of Positive Integers and Their Decision Problems.Emil L. Post - 1945 - Journal of Symbolic Logic 10 (1):18-19.
    Download  
     
    Export citation  
     
    Bookmark   44 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  
  • (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  
  • Index sets related to prompt simplicity.Steven Schwarz - 1989 - Annals of Pure and Applied Logic 42 (3):243-254.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Labelling systems and R.E. structures.C. J. Ash - 1990 - Annals of Pure and Applied Logic 47 (2):99-119.
    Download  
     
    Export citation  
     
    Bookmark   15 citations  
  • (1 other version)Review: J. R. Shoenfield, J. W. Addison, Leon Henkin, Alfred Tarski, Applications of Model Theory to Degrees of Unsolvability. [REVIEW]Gerald E. Sacks - 1972 - Journal of Symbolic Logic 37 (3):610-611.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Undecidable and Creative Theories.J. R. Shoenfield - 1967 - Journal of Symbolic Logic 32 (1):123-123.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • Two Recursively Enumerable Sets of Incomparable Degrees of Unsolvability.R. M. Friedberg - 1958 - Journal of Symbolic Logic 23 (2):225-226.
    Download  
     
    Export citation  
     
    Bookmark   22 citations