Switch to: References

Add citations

You must login to add citations.
  1. Highness and local noncappability.Chengling Fang, Wang Shenling & Guohua Wu - 2012 - In S. Barry Cooper (ed.), How the World Computes. pp. 203--211.
    Download  
     
    Export citation  
     
    Bookmark  
  • Highness, locally noncappability and nonboundings.Frank Stephan & Guohua Wu - 2013 - Annals of Pure and Applied Logic 164 (5):511-522.
    In this paper, we improve a result of Seetapun and prove that above any nonzero, incomplete recursively enumerable degree a, there is a high2 r.e. degree c>ac>a witnessing that a is locally noncappable . Theorem 1.1 provides a scheme of obtaining high2 nonboundings , as all known high2 nonboundings, such as high2 degrees bounding no minimal pairs, high2 plus-cuppings, etc.
    Download  
     
    Export citation  
     
    Bookmark