Coding in the automorphism group of a computably categorical structure
Dan Turetsky · Journal of Mathematical Logic · 2020
Using new techniques for controlling the categoricity spectrum of a structure, we construct a structure with degree of categoricity but infinite spectral dimension, answering a question of Bazhenov, Kalimullin and Yamaleev. Using the same techniques, we construct a computably categorical structure of non-computable Scott rank.