The diversity of categoricity without delay. (English. Russian original) Zbl 1423.03151
Algebra Logic 56, No. 2, 171-177 (2017); translation from Algebra Logika 56, No. 2, 256-266 (2017).
MSC:
| 03D45 | Theory of numerations, effectively presented structures |
| 03C57 | Computable structure theory, computable model theory |
| 03C35 | Categoricity and completeness of theories |
References:
| [1] | I. Kalimullin, A. Melnikov, and K. M. Ng, “Algebraic structures computable without delay,” Theor. Comput. Sci., 674, 73-98 (2017). · Zbl 1418.03151 · doi:10.1016/j.tcs.2017.01.029 |
| [2] | D. Cenzer and J. Remmel, “Polynomial-time versus recursive models,” Ann. Pure Appl. Log., 54, No. 1, 17-58 (1991). · Zbl 0756.03021 · doi:10.1016/0168-0072(91)90008-A |
| [3] | 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). · Zbl 1161.03021 · doi:10.1007/s00153-008-0113-3 |
| [4] | C. J. Ash and J. F. Knight, Computable Structures and the Hyperarithmetical Hierarchy, Stud. Log. Found. Math., 144, Elsevier, Amsterdam (2000). · Zbl 0960.03001 |
| [5] | S. S. Goncharov and Yu. L. Ershov, Constructive Models, Siberian School of Algebra and Logic [in Russian] Nauch. Kniga, Novosibirsk (1999). · Zbl 1043.03518 |
| [6] | P. E. Alaev, “Existence and uniqueness of structures computable in polynomial time,” Algebra and Logic, 55, No. 1, 72-76 (2016). · Zbl 1361.03042 · doi:10.1007/s10469-016-9377-6 |
| [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, No. 2, 497-514 (1986). · Zbl 0631.03017 · doi:10.1090/S0002-9947-1986-0860377-7 |
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.
