Author:
Ambos-Spies Klaus,Lachlan Alistair H.,Soare Robert I.
Reference5 articles.
1. An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees;Ambos-Spies;Trans. Amer. Math. Soc.,1984
2. Games in recursion theory and continuity properties of capping degrees;Harrington,1989
3. D. Seetapun, Every low2 recursively enumerable degree is locally noncuppable, Preprint.
4. D. Seetapun, Every recursively enumerable degree is locally noncappable, Preprint.
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. CUPPING AND JUMP CLASSES IN THE COMPUTABLY ENUMERABLE DEGREES;The Journal of Symbolic Logic;2020-10-30
2. Relative enumerability and 1-genericity;The Journal of Symbolic Logic;2011-09
3. Principal filters definable by parameters in bT;Mathematical Structures in Computer Science;2009-02
4. Continuity of capping in CbT;Annals of Pure and Applied Logic;2008-08
5. On Lachlan’s major sub-degree problem;Archive for Mathematical Logic;2008-06-27