Funder
National Science Foundation
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Chisholm, J., Moses, M.: An undecidable linear order that is $$n$$-decidable for all $$n$$. Notre Dame J. Formal Logic 39(4), 519–526 (1998)
2. Fokina, E.B., Goncharov, S.S., Kharizanova, V., Kudinov, O.V., Turetski, D.: Index sets of $$n$$-decidable structures that are categorical with respect to $$m$$-decidable representations. Algebra Logika 54(4), 520–528544545547548 (2015)
3. Fokina, E.B., Harizanov, V., Melnikov, A.G.: Computable model theory. In: Downey, R. (ed.) Turing’s Legacy: Developments from Turing’s Ideas in Logic. Cambridge University Press, Cambridge (2014)
4. Ben Yaacov, I., Berenstein, A., Henson, C.W., Usvyatsov, A.: Model theory for metric structures. In: Model Theory with Applications to Algebra and Analysis. Vol. 2. London Math. Soc. Lecture Note Ser., vol. 350, pp. 315–427. Cambridge Univ. Press, Cambridge (2008)
5. Melnikov, A.G.: Computably isometric spaces. J. Symb. Logic 78(4), 1055–1085 (2013)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Hyperarithmetic Numerals;Lecture Notes in Computer Science;2024