Switch to: References

Add citations

You must login to add citations.
  1. Bounded-low sets and the high/low hierarchy.Huishan Wu - 2020 - Archive for Mathematical Logic 59 (7-8):925-938.
    Anderson and Csima defined a bounded jump operator for bounded-Turing reduction, and studied its basic properties. Anderson et al. constructed a low bounded-high set and conjectured that such sets cannot be computably enumerable. Ng and Yu proved that bounded-high c.e. sets are Turing complete, thus answered the conjecture positively. Wu and Wu showed that bounded-low sets can be superhigh by constructing a Turing complete bounded-low c.e. set. In this paper, we continue the study of the comparison between the bounded-jump and (...)
    Download  
     
    Export citation  
     
    Bookmark