
|
Computability with Partial Information |
|
Supported by the Bulgarian National Science Fund |

|
Publications → The omega enumeration degrees |
|
H. Ganchev, Exact pair theorem for the omega-enumeration degrees, Computation and Logic in the Real World, LNCSvol. 4497, (2007), 316--324. H. Ganchev and M. Soskova, The high/low hierarchy in the local structure of the ω-enumeration degrees, accepted for publication in the Annals of Pure and Applied Logic. I. Soskov, The omega-enumeration dgerees, Journal of Logic and Computation, 17(2007) 1193 - 1217. I. Soskov and H. Ganchev, The jump operator on the omega-enumeration degrees, Annals of Pure and Applied Logic, 160 (2009), 289--301. M. Soskova and I. Soskov , Embedding countable partial orderings in the enumeration degrees and the omega-enumeration degrees, accepted for publication in the Journal of Logic and Computation.
H. Ganchev, Definability in the local theory of the omega-enumeration degrees, Mathematical theory and computational practice, LNCS, 5635, Springer, Heidelberg, 2009, 242--249.
I. Soskov, H. Ganchev and M. Soskova, Kalimullin pairs of Σ02 omega-enumeration degrees, Трудове на конференцията “120 години ФМИ” към СУ, 2009. |