Switch to: References

Add citations

You must login to add citations.
  1. Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
    We investigate strong versions of enumeration reducibility, the most important one being s-reducibility. We prove that every countable distributive lattice is embeddable into the local structure $L(\mathfrak D_s)$ of the s-degrees. However, $L(\mathfrak D_s)$ is not distributive. We show that on $\Delta^{0}_{2}$ sets s-reducibility coincides with its finite branch version; the same holds of e-reducibility. We prove some density results for $L(\mathfrak D_s)$ . In particular $L(\mathfrak D_s)$ is upwards dense. Among the results about reducibilities that are stronger than s-reducibility, (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • In memoriam: Barry Cooper 1943–2015.Andrew Lewis-Pye & Andrea Sorbi - 2016 - Bulletin of Symbolic Logic 22 (3):361-365.
    Download  
     
    Export citation  
     
    Bookmark