Publisher
Springer Science and Business Media LLC
Reference4 articles.
1. Yu. L. Ershov, “On computable enumeration,” Algebra i Logika,7, No. 5, 71–99 (1968).
2. A. I. Mal'tsev, Algorithms and Recursive Functions [in Russian], Nauka (1965).
3. A. H. Lachlan, “A note on universal sets,” J. Symb. Logic,31, No. 4, 573–574 (1966).
4. A. H. Lachlan, “Standard classes of recursively-enumerable sets,” Z. Math. Log. Grund. Math.,10, 23–42 (1964).
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献