Switch to: References

Add citations

You must login to add citations.
  1. Parameter definability in the recursively enumerable degrees.André Nies - 2003 - Journal of Mathematical Logic 3 (01):37-65.
    The biinterpretability conjecture for the r.e. degrees asks whether, for each sufficiently large k, the [Formula: see text] relations on the r.e. degrees are uniformly definable from parameters. We solve a weaker version: for each k ≥ 7, the [Formula: see text] relations bounded from below by a nonzero degree are uniformly definable. As applications, we show that Low 1 is parameter definable, and we provide methods that lead to a new example of a ∅-definable ideal. Moreover, we prove that (...)
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark   6 citations  
  • Interpreting true arithmetic in the Δ 0 2 -enumeration degrees.Thomas F. Kent - 2010 - Journal of Symbolic Logic 75 (2):522-550.
    We show that there is a first order sentence φ(x; a, b, l) such that for every computable partial order.
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark