Switch to: References

Add citations

You must login to add citations.
  1. Splitting theorems in recursion theory.Rod Downey & Michael Stob - 1993 - Annals of Pure and Applied Logic 65 (1):1-106.
    A splitting of an r.e. set A is a pair A1, A2 of disjoint r.e. sets such that A1 A2 = A. Theorems about splittings have played an important role in recursion theory. One of the main reasons for this is that a splitting of A is a decomposition of A in both the lattice, , of recursively enumerable sets and in the uppersemilattice, R, of recursively enumerable degrees . Thus splitting theor ems have been used to obtain results about (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • On strongly jump traceable reals.Keng Meng Ng - 2008 - Annals of Pure and Applied Logic 154 (1):51-69.
    In this paper we show that there is no minimal bound for jump traceability. In particular, there is no single order function such that strong jump traceability is equivalent to jump traceability for that order. The uniformity of the proof method allows us to adapt the technique to showing that the index set of the c.e. strongly jump traceables is image-complete.
    Download  
     
    Export citation  
     
    Bookmark   4 citations  
  • Interpreting N in the computably enumerable weak truth table degrees.André Nies - 2001 - Annals of Pure and Applied Logic 107 (1-3):35-48.
    We give a first-order coding without parameters of a copy of in the computably enumerable weak truth table degrees. As a tool, we develop a theory of parameter definable subsets.
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On definable filters in computably enumerable degrees.Wei Wang & Decheng Ding - 2007 - Annals of Pure and Applied Logic 147 (1):71-83.
    On definable filters in computably enumerable degrees.
    Download  
     
    Export citation  
     
    Bookmark