Automorphism Groups of Substructure Lattices of Vector Spaces in Computable Algebra [chapter]

Rumen Dimitrov, Valentina Harizanov, Andrei Morozov
2016 Lecture Notes in Computer Science  
The authors are listed lexicographically, as customary in mathematics.) 62. E. Fokina, V. Harizanov, and D. Turetsky, "Computability-theoretic categoricity and Scott families," 25 pages, submitted. 61. J. Chubb, M. Dabkowski, and V. Harizanov, "Groups with orderings of arbitrary algorithmic complexity," 22 pages, accepted for publication in: Sets and Computations (IMS, National University of Singapore), R. Dilip, S.D. Friedman, and Y. Yang, editors, World Scientific, to appear 2017. 60. R.
more » ... rov and V. Harizanov, "The lattice of computably enumerable vector spaces," in: Computability and Complexity, A. Day, M. Fellows, N. "Index sets for ndecidable structures categorical relative to m-decidable presentations," Algebra and Logic 54 (2015), pp. 520-528 (Russian); pp. 336-341 (English translation). 55. W. Calvert, V. Harizanov, and A. Shlapentokh, "Turing degrees of isomorphism types of geometric objects," Computability 3 (2014), pp. 105-134. 54. E. Fokina, V. Harizanov, and A. Melnikov, "Computable model theory," in: Turing's Legacy:
doi:10.1007/978-3-319-40189-8_26 fatcat:2p5s2kf5xzfwfdf7zakfx43mpy