Switch to: Citations

Add references

You must login to add references.
  1. Minimal pairs and high recursively enumerable degrees.S. B. Cooper - 1974 - Journal of Symbolic Logic 39 (4):655-660.
    Download  
     
    Export citation  
     
    Bookmark   22 citations  
  • Highness and bounding minimal pairs.Rodney G. Downey, Steffen Lempp & Richard A. Shore - 1993 - Mathematical Logic Quarterly 39 (1):475-491.
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • On very high degrees.Keng Meng Ng - 2008 - Journal of Symbolic Logic 73 (1):309-342.
    In this paper we show that there is a pair of superhigh r.e. degree that forms a minimal pair. An analysis of the proof shows that a critical ingredient is the growth rates of certain order functions. This leads us to investigate certain high r.e. degrees, which resemble ∅′ very closely in terms of ∅′-jump traceability. In particular, we will construct an ultrahigh degree which is cappable.
    Download  
     
    Export citation  
     
    Bookmark   4 citations