Computability with Partial Information |
Supported by the Bulgarian National Science Fund |
Publications → Enumeration degrees |
1. M. Arslanov, S. B. Cooper, I. Kalimullin and M. Soskova, Splitting and Nonsplitting in the Σ20 Enumeration Degrees, Theoretical Computer Science, Vol. 412 (2011), pp. 1669-1685 2. H. Ganchev and M. Soskova, Embedding distributive lattices in the Σ02 enumeration degrees, Journal of Logic and Computation, doi:10.1093/logcom/exq042 3. M. Soskova, The Limitations of Cupping in the Local Structure of the Enumeration Degrees, Arch. Math. Logic, Vol. 49 (2010), pp. 169 -193 4. M. Soskova, A Non-splitting Theorem in the Enumeration Degrees, Ann. Pure Appl. Logic, Vol. 160, (2009) 400-418. 5. H. Ganchev and M. Soskova, Cupping and definability in the local structure of the enumeration degrees, Journal of Symbolic Logic, Vol. 77 (2012), pp. 133-158 6. A. Sorbi, G. Wu and Y. Yang, Diamond embeddings into the enumeration degrees, Math. Struct. in Comp. Science, Vol. 20 (2010), pp. 799-811 7. D. Marsibilio and A.Sorbi, Bounded enumeration reducibility and its degree structure, Arch. Math. Logic, doi 10.1007/s00153-011-0259-2 8. Roland Omanadze and Andrea Sorbi, Immunity properties of the s-degrees, Georgian Math J., Vol. 17 (2010) 9. D. Marsibilio and A. Sorbi, First order theory of the s-degrees and arithmetic, Rapporto Matematico no 505 del Dipartimento di Scienze Matematiche ed Informatiche "Roberto Magari", University of Siena, 2012 10. Theodore A. Slaman and A. Sorbi, A note on the enumeration degrees, Rapporto Matematico no 506 del Dipartimento di Scienze Matematiche ed Informatiche Roberto Magari, University of Siena 11. Mariya Soskova and Hristo Ganchev, Definability in the local structure of the enumeration degrees, submitted, 2012 12. H. A. Ganchev and M. I. Soskova, Interpreting true arithmetic in the local structure of the enumeration degrees, accepted to Journal of Symbolic Logic 13. G. Barmpalias, A. R. Day, and A. E.M. Lewis, The typical Turing degree, submitted in Journal of Mathematical Logic, 2012 14. C. G. Jockush Jr. and A.E.M. Lewis, Diagonally non-computable functions and bi-immunity, submitted to Journal of Symbolic Logic, 2012 15. G. Barmpalias, R. Hoelz, A.E.M. Lewis, and W. Merkele, Analogues of Chaitin’s Omega in the computably enumerable sets, Submitted, 2012
|