Voir la notice de l'article provenant de la source Math-Net.Ru
@article{AL_2017_56_2_a6, author = {I. S. Kalimullin and A. G. Melnikov and K. M. Ng}, title = {The diversity of categoricity without delay}, journal = {Algebra i logika}, pages = {256--266}, publisher = {mathdoc}, volume = {56}, number = {2}, year = {2017}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/AL_2017_56_2_a6/} }
I. S. Kalimullin; A. G. Melnikov; K. M. Ng. The diversity of categoricity without delay. Algebra i logika, Tome 56 (2017) no. 2, pp. 256-266. http://geodesic.mathdoc.fr/item/AL_2017_56_2_a6/
[1] I. Kalimullin, A. Melnikov, K. M. Ng, “Algebraic structures computable without delay”, Theoret. Comput. Sci., 674 (2017), 73–98 | DOI | MR | Zbl
[2] D. Cenzer, J. Remmel, “Polynomial-time versus recursive models”, Ann. Pure Appl. Logic, 54:1 (1991), 17–58 | DOI | MR | Zbl
[3] D. Cenzer, R. G. Downey, J. B. Remmel, Z. Uddin, “Space complexity of abelian groups”, Arch. Math. Logic, 48:1 (2009), 115–140 | DOI | MR | Zbl
[4] C. J. Ash, J. F. Knight, Computable structures and the hyperarithmetical hierarchy, Stud. Logic Found. Math., 144, Elsevier Sci. B. V., Amsterdam etc., 2000 | MR | Zbl
[5] S. S. Goncharov, Yu. L. Ershov, Konstruktivnye modeli, Sibirskaya shkola algebry i logiki, Nauchnaya kniga, Novosibirsk, 1999
[6] P. E. Alaev, “Suschestvovanie i edinstvennost struktur, vychislimykh za polinomialnoe vremya”, Algebra i logika, 55:1 (2016), 106–112 | Zbl
[7] L. Kristiansen, Papers on Subrecursion Theory, Dr. scient.-graden, Research report 217, PhD thesis, Dep. Inform., Univ. Oslo, 1996
[8] C. J. Ash, “Recursive labelling systems and stability of recursive structures in hyperarithmetical degrees”, Trans. Am. Math. Soc., 298:2 (1986), 497–514 | DOI | MR | Zbl