The Diversity of Categoricity Without Delay

I. Kalimullin, A. Melnikov, and K. M. Ng, “Algebraic structures computable without delay,” Theor. Comput. Sci., 674, 73-98 (2017). D. Cenzer and J. Remmel, “Polynomial-time versus recursive models,” Ann. Pure Appl. Log., 54, No. 1, 17-58 (1991). D. Cenzer, R. G. Downey, J. B. Remmel, and Z. Uddin, “Space complexity of Abelian groups,” Arch. Math. Log., 48, No. 1, 115-140 (2009). C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Stud. Log. Found. Math., 144, Elsevier, Amsterdam (2000). S. S. Goncharov and Yu. L. Ershov, Constructive Models, Siberian School of Algebra and Logic [in Russian] Nauch. Kniga, Novosibirsk (1999). P. E. Alaev, “Existence and uniqueness of structures computable in polynomial time,” Algebra and Logic, 55, No. 1, 72-76 (2016). L. Kristiansen, Papers on Subrecursion Theory, Dr. scient.-graden, Research report 217, PhD thesis, Dep. Inform., Univ. Oslo (1996). C. J. Ash, “Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees,” Trans. Am. Math. Soc., 298, No. 2, 497-514 (1986).