Publisher
Springer Science and Business Media LLC
Reference5 articles.
1. A. N. Degtev, ,“Hypersimple sets with retraceable complements,” Alg. i Log.,10, No. 3, 235–246 (1971).
2. Yu. L. Ershov, ,“Hyperhypersimple m-powers,” Algebra i Logika,8, No. 5, 523–552 (1969).
3. A. H. Lachlan, ,“On the lattice of recursively enumerable sets,” Trans. Amer. Math. Soc.,131, No. 1, 1–37 (1968).
4. R. W. Robinson, ,“Simplicity of recursively enumerable sets,” J. Symbolic Logic,32, No. 2, 162–172 (1967).
5. J. E. Sacks, ,“A maximal set which is not complete,” Michigan Math. J.,11, No. 3, 193–205 (1964).
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献