Switch to: References

Add citations

You must login to add citations.
  1. 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  
  • Strong Jump-Traceability.Noam Greenberg & Dan Turetsky - 2018 - Bulletin of Symbolic Logic 24 (2):147-164.
    We review the current knowledge concerning strong jump-traceability. We cover the known results relating strong jump-traceability to randomness, and those relating it to degree theory. We also discuss the techniques used in working with strongly jump-traceable sets. We end with a section of open questions.
    Download  
     
    Export citation  
     
    Bookmark   1 citation