Switch to: References

Citations of:

Degrees of unsolvability: structure and theory

New York: Springer Verlag (1979)

Add citations

You must login to add citations.
  1. Strong Minimal Covers for Recursively Enumerable Degrees.S. Barry Cooper - 1996 - Mathematical Logic Quarterly 42 (1):191-196.
    We prove that there exists a nonzero recursively enumerable Turing degree possessing a strong minimal cover.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • The n-r.E. Degrees: Undecidability and σ1 substructures.Mingzhong Cai, Richard A. Shore & Theodore A. Slaman - 2012 - Journal of Mathematical Logic 12 (1):1250005-.
    We study the global properties of [Formula: see text], the Turing degrees of the n-r.e. sets. In Theorem 1.5, we show that the first order of [Formula: see text] is not decidable. In Theorem 1.6, we show that for any two n and m with n < m, [Formula: see text] is not a Σ1-substructure of [Formula: see text].
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • Degree structures: Local and global investigations.Richard A. Shore - 2006 - Bulletin of Symbolic Logic 12 (3):369-389.
    The occasion of a retiring presidential address seems like a time to look back, take stock and perhaps look ahead.Institutionally, it was an honor to serve as President of the Association and I want to thank my teachers and predecessors for guidance and advice and my fellow officers and our publisher for their work and support. To all of the members who answered my calls to chair or serve on this or that committee, I offer my thanks as well. Your (...)
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Reducibility orderings: Theories, definability and automorphisms.Anil Nerode & Richard A. Shore - 1980 - Annals of Mathematical Logic 18 (1):61-89.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Complementing below recursively enumerable degrees.S. Barry Cooper & Richard L. Epstein - 1987 - Annals of Pure and Applied Logic 34 (1):15-32.
    Download  
     
    Export citation  
     
    Bookmark   3 citations