A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
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.doi:10.1007/978-3-319-40189-8_26 fatcat:2p5s2kf5xzfwfdf7zakfx43mpy