Author:
Goncharov S. S.,Badaev S. A.
Publisher
Springer Science and Business Media LLC
Reference16 articles.
1. S. S. Goncharov and S. A. Badaev, “Classes with pairwise equivalent enumerations,” inLogical Foundations of Computer Science, Lect. Notes Comp. Sc.,813, 140–141 (1994).
2. Yu. L. Ershov,Numeration Theory [in Russian], Nauka, Moscow (1977).
3. H. Rogers,Theory of Recursive Function and Effective Computability, McGraw-Hill, New York (1967).
4. J. L. Kelley,General Topology, Van Nostrand, New York (1957).
5. H. G. Rice, “On completely recursively enumerable classes and their key arrays,”J. Symb. Log.,21, No. 3, 304–308 (1956).
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献