Author:
Boyadzhiyska S.,Lange K.,Raz A.,Scanlon R.,Wallbaum J.,Zhang X.
Publisher
Springer Science and Business Media LLC
Reference13 articles.
1. R. F. Friedberg, “Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication,” J. Symb. Log., 23, No. 3, 309-316 (1958).
2. S. S. Goncharov, S. Lempp, and D. R. Solomon, “Friedberg numberings of families of ncomputably enumerable sets,” Algebra and Logic, 41, No. 2, 81-86 (2002).
3. S. S. Goncharov and N. T. Kogabaev, “On $$ {\varSigma}_1^0 $$-classification of relations on computable structures,” Vestnik NGU, Mat., Mekh., Inf., 8, No. 4, 23-32 (2008).
4. W. Calvert, D. Cenzer, V. Harizanov, and A. Morozov, “Effective categoricity of equivalence structures,” Ann. Pure Appl. Log., 141, Nos. 1/2, 61-78 (2006).
5. D. Cenzer, V. Harizanov, and J. B. Remmel, “Computability-theoretic properties of injection structures,” Algebra and Logic, 53, No. 1, 39-69 (2014).
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献