References
N. Bazhenov, R. Downey, I. Kalimullin, and A. Melnikov, “Foundations of online structure theory,” Bull. Symb. Log., 25, No. 2, 141-181 (2019).
I. Kalimullin, A. Melnikov, and K. M. Ng, “Algebraic structures computable without delay,” Theor. Comput. Sci., 674, 73-98 (2017).
I. Kalimullin, A. Melnikov A., and K. M. Ng, “The diversity of categoricity without delay,” Algebra and Logic, 56, No. 2, 171-177 (2017).
P. E. Alaev, “Structures computable in polynomial time. I,” Algebra and Logic, 55, No. 6, 421-435 (2016).
P. E. Alaev, “Structures computable in polynomial time. II,” Algebra and Logic, 56, No. 6, 429-442 (2017).
P. E. Alaev, “Categoricity for primitive recursive and polynomial Boolean algebras,” Algebra and Logic, 57, No. 4, 251-274 (2018).
I. Sh. Kalimullin and R. Miller, “Primitive recursive fields and categoricity,” Algebra and Logic, 58, No. 1, 95-99 (2019).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Algebra i Logika, Vol. 59, No. 5, pp. 600-605, September-October, 2020. Russian DOI: https://doi.org/10.33048/alglog.2020.59.507.
I. Sh. Kalimullin is Supported by Russian Science Foundation, (project No. 18-11-00028) and by the Russian Ministry of Education and Science (project No. 1.451.2016/1.4).
Rights and permissions
About this article
Cite this article
Kalimullin, I.S. Constructing Punctually Categorical Semigroups. Algebra Logic 59, 408–411 (2020). https://doi.org/10.1007/s10469-020-09614-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10469-020-09614-8