Switch to: Citations

Add references

You must login to add references.
  1. Decomposition and infima in the computably enumerable degrees.Rodney G. Downey, Geoffrey L. Laforte & Richard A. Shore - 2003 - Journal of Symbolic Logic 68 (2):551-579.
    Given two incomparable c.e. Turing degrees a and b, we show that there exists a c.e. degree c such that c = (a ⋃ c) ⋂ (b ⋃ c), a ⋃ c | b ⋃ c, and c < a ⋃ b.
    Download  
     
    Export citation  
     
    Bookmark   1 citation  
  • Computability theory and linear orders.Rod Downey - 1998 - In I︠U︡riĭ Leonidovich Ershov (ed.), Handbook of recursive mathematics. New York: Elsevier. pp. 138--823.
    Download  
     
    Export citation  
     
    Bookmark   13 citations