Author:
Andrews U.,Dushenin D. I.,Hill C.,Knight J. F.,Melnikov A. G.
Publisher
Springer Science and Business Media LLC
Reference12 articles.
1. H. Friedman and L. Stanley, “On Borel reducibility theory for classes of computable structures,” J. Symb. Log., 54, No. 3, 894–914 (1989).
2. W. Calvert, D. Cummins, J. F. Knight, and S. Miller, “Comparing classes of finite structures,” Algebra and Logic, 43, No. 6, 374–392 (2004).
3. E. B. Fokina, J. F. Knight, A. Melnikov, S. M. Quinn, and C. M. Safranski, “Classes of Ulm type and coding rank-homogeneous trees in other structures,” J. Symb. Log., 76, No. 3, 846–869 (2011).
4. J. F. Knight, S. Miller, and M. Vanden Boom, “Turing computable embeddings,” J. Symb. Log., 72, No. 3, 901–918 (2007).
5. C. Maher, “On embeddings of computable structures, classes of structures, and computable isomorphism,” Ph. D. Thesis, Univ. Notre Dame (2009).
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献