Author:
Fokina Ekaterina B.,Friedman Sy-David
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Ash, C.J., Knight, J.F.: Computable Structures and the Hyperarithmetical Hierarchy. Elsevier, Amsterdam (2000)
2. Calvert, W.: The isomorphism problem for computable abelian p-groups of bounded length. J. Symbolic Logic 70(1), 331–345 (2005)
3. Calvert, W.: The isomorphism problem for classes of computable fields. Arch. Math. Logic 43(3), 327–336 (2004)
4. Calvert, W., Cummins, D., Knight, J.F., Miller, S.: Comparing classes of finite structures. Algebra and Logic 43, 374–392 (2004)
5. Carson, J., Fokina, E., Harizanov, V., Knight, J., Maher, C., Quinn, S., Wallbaum, J.: Computable Embedding Problem (submitted)
Cited by
17 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献