Author:
Csima Barbara F.,Franklin Johanna N. Y.,Shore Richard A.
Reference9 articles.
1. [1] Ash, C. J., and J. Knight, Computable Structures and the Hyperarithmetical Hierarchy, vol. 144 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 2000.
2. [2] Fokina, E. B., I. Kalimullin, and R. Miller, “Degrees of categoricity of computable structures,” Archive for Mathematical Logic, vol. 49 (2010), pp. 51–67.
3. [3] Harizanov, V. S., “Pure computable model theory,” pp. 3–114 in Handbook of Recursive Mathematics, Vol. 1, vol. 138 of Studies in Logic and the Foundations of Mathematics, North-Holland, Amsterdam, 1998.
4. [4] Hirschfeldt, D. R., and W. M. White, “Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures,” Notre Dame Journal of Formal Logic, vol. 43 (2002), pp. 51–64.
5. [5] Marker, D., “Non $\Sigma_{n}$ axiomatizable almost strongly minimal theories,” Journal of Symbolic Logic, vol. 54 (1989), pp. 921–27.
Cited by
54 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献