Author:
Ganchev Hristo,Soskov Ivan N.
Reference13 articles.
1. Partial degrees and the density problem. Part 2: The enumeration degrees of the Σ2 sets are dense;Cooper;J. Symbolic Logic,1984
2. Enumeration reducibility, nondeterministic computations and relative computability of partial functions;Cooper,1990
3. Definability of the jump operator in the enumeration degrees;Kalimullin;J. Math. Log.,2003
4. The n-rea enumeration degrees are dense;Lachlan;Arch. Math. Logic,1992
5. Degrees of Unsolvability;Lerman,1983
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献