Switch to: Citations

Add references

You must login to add references.
  1. 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  
  • Degrees of Unsolvability.Gerald E. Sacks - 1966 - Princeton University Press.
    The description for this book, Degrees of Unsolvability. (AM-55), Volume 55, will be forthcoming.
    Download  
     
    Export citation  
     
    Bookmark   47 citations  
  • The density of the nonbranching degrees.Peter A. Fejer - 1983 - Annals of Pure and Applied Logic 24 (2):113-130.
    Download  
     
    Export citation  
     
    Bookmark   17 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  
  • 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  
  • The Fine Structure of Degrees of Unsolvability of Recursively Enumerable Sets.R. M. Friedberg - 1963 - Journal of Symbolic Logic 28 (2):166-166.
    Download  
     
    Export citation  
     
    Bookmark   3 citations  
  • The recursively enumerable degrees have infinitely many one-types.Klaus Ambos-Spies & Robert I. Soare - 1989 - Annals of Pure and Applied Logic 44 (1-2):1-23.
    Download  
     
    Export citation  
     
    Bookmark   11 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  
  • (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  
  • The density of infima in the recursively enumerable degrees.Theodore A. Slaman - 1991 - Annals of Pure and Applied Logic 52 (1-2):155-179.
    We show that every nontrivial interval in the recursively enumerable degrees contains an incomparable pair which have an infimum in the recursively enumerable degrees.
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
    • Home | Bibliographies | About PhilArchive | Contact us | Code of conduct

    CDP Phiosophy Documentation Center
    PhilPapers logo by Andrea Andrews and Meghan Driscoll.
    This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications).

    Use of this site is subject to terms & conditions.
    All rights reserved by The PhilPapers Foundation

    Server: philpapers-web-7674574dd6-8q2d6 uwo