Publisher
Springer International Publishing
Reference24 articles.
1. Ash, C.J., Knight, J.F.: Computable structures and the hyperarithmetical hierarchy, Stud. Logic Found. Math., vol. 144. Elsevier Science B.V., Amsterdam (2000)
2. Badaev, S.A., Goncharov, S.S.: The theory of numberings: open problems. In: Cholak, P., Lempp, S., Lerman, M., Shore, R. (eds.) Computability Theory and Its Applications. Contemporary Mathematics, vol. 257, pp. 23–38. American Mathematical Society, Providence (2000). https://doi.org/10.1090/conm/257/04025
3. Baumgartner, J.E.: Chains and antichains in $$\cal{P} (\omega )$$. J. Symb. Log. 45(1), 85–92 (1980). https://doi.org/10.2307/2273356
4. Bazhenov, N., Harrison-Trainor, M., Kalimullin, I., Melnikov, A., Ng, K.M.: Automatic and polynomial-time algebraic structures. J. Symb. Log. 84(4), 1630–1669 (2019). https://doi.org/10.1017/jsl.2019.26
5. Calvert, W., Knight, J.F.: Classification from a computable viewpoint. Bull. Symb. Log. 12(2), 191–218 (2006). https://doi.org/10.2178/bsl/1146620059
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On Concept Lattices for Numberings;Tsinghua Science and Technology;2024-12