Constructing punctually categorical semigroups (Q828124): Difference between revisions

A finitely generated algebraic structure is \textit{punctual} if all signature operations and predicates are primitive recursive, and its universe coincides with the set of natural numbers. A punctual algebraic structure is \textit{punctually categorical} if it is primitive recursively isomorphic to any of its primitive recursive copies. It is rather difficult to find nontrivial examples of punctually categorical structures in natural algebraic classes, see [\textit{I. Kalimullin} et al., Theor. Comput. Sci. 674, 73--98 (2017; Zbl 1418.03151); \textit{I. Sh. Kalimullin} and \textit{R. Miller}, Algebra Logic 58, No. 1, 95--99 (2019; Zbl 1468.03043); translation from Algebra Logika 58, No. 1, 132--138 (2019)]. In this article, the authors prove that there exists a punctually categorical finitely generated semigroup. They point out that the question remains open whether there exists a punctually categorical semigroup defined by finitely many relations.