Switch to: References

Add citations

You must login to add citations.
  1. Non-empty open intervals of computably enumerable sQ 1-degrees.Roland Omanadze & Irakli Chitaia - forthcoming - Logic Journal of the IGPL.
    We prove that if $A$, $B$ are noncomputable c.e. sets, $A<_{sQ_{1}}B$ and [($B$ is not simple and $A\oplus B\leq _{sQ_{1}}B$) or $B\equiv _{sQ_{1}}B\times \omega $], then there exist infinitely many pairwise $sQ_{1}$-incomparable c.e. sets $\{C_{i}\}_{i\in \omega }$ such that $A<_{sQ_{1}}C_{i}<_{sQ_{1}}B$, for all $i\in \omega $. We also show that there exist infinite collections of $sQ_{1}$-degrees $\{\boldsymbol {a_{i}}\}_{i\in \omega }$ and $\{\boldsymbol {b_{i}}\}_{i\in \omega }$ such that for every $i, j,$ (1) $\boldsymbol {a_{i}}<_{sQ_{1}}\boldsymbol {a_{i+1}}$, $\boldsymbol {b_{j+1}}<_{sQ_{1}}\boldsymbol {b_{j}}$ and $\boldsymbol {a_{i}}<_{sQ_{1}}\boldsymbol {b_{j}}$; (...)
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • System functions and their decision problems.M. B. Thuraisingham - 1984 - Mathematical Logic Quarterly 30 (7‐8):119-128.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • System Functions and Their Decision Problems.M. B. Thuraisingham - 1984 - Mathematical Logic Quarterly 30 (7-8):119-128.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  • On the Simplicity of Busy Beaver Sets.Robert P. Daley - 1978 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 24 (13-14):207-224.
    No categories
    Direct download  
     
    Export citation  
     
    Bookmark   1 citation