Switch to: Citations

Add references

You must login to add references.
  1. A real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one.Chris J. Conidis - 2012 - Journal of Symbolic Logic 77 (2):447-474.
    Recently, the Dimension Problem for effective Hausdorff dimension was solved by J. Miller in [14], where the author constructs a Turing degree of non-integral Hausdorff dimension. In this article we settle the Dimension Problem for effective packing dimension by constructing a real of strictly positive effective packing dimension that does not compute a real of effective packing dimension one (on the other hand, it is known via [10, 3, 7] that every real of strictly positive effective Hausdorff dimension computes reals (...)
    Download  
     
    Export citation  
     
    Bookmark   2 citations  
  • On Degrees of Recursive Unsolvability.Clifford Spector - 1957 - Journal of Symbolic Logic 22 (4):374-375.
    Download  
     
    Export citation  
     
    Bookmark   16 citations  
  • Effective Packing Dimension and Traceability.Rod Downey & Keng Meng Ng - 2010 - Notre Dame Journal of Formal Logic 51 (2):279-290.
    We study the Turing degrees which contain a real of effective packing dimension one. Downey and Greenberg showed that a c.e. degree has effective packing dimension one if and only if it is not c.e. traceable. In this paper, we show that this characterization fails in general. We construct a real $A\leq_T\emptyset''$ which is hyperimmune-free and not c.e. traceable such that every real $\alpha\leq_T A$ has effective packing dimension 0. We construct a real $B\leq_T\emptyset'$ which is not c.e. traceable such (...)
    Download  
     
    Export citation  
     
    Bookmark   3 citations