
It is proved that the monoid RN of all partial recursive functions of one variable is finitely generated, and that RN × RNis a cyclic (left and right) RN-act (under the natural diagonal actions s (a, b) = (sa, sb), (a, b) s = (as, bs)). We also construct a finitely presented monoid S such that S × S is a cyclic left and right S-act, and study further interesting properties of diagonal acts and their relationship with power monoids.
diagonal acts, power monoids, Free semigroups, generators and relations, word problems, finitely presented monoids, finitely generated monoids, Representation of semigroups; actions of semigroups on sets, Recursive functions and relations, subrecursive hierarchies, Semigroups of transformations, relations, partitions, etc., monoids of partial recursive functions, bi-acts, cyclic acts
diagonal acts, power monoids, Free semigroups, generators and relations, word problems, finitely presented monoids, finitely generated monoids, Representation of semigroups; actions of semigroups on sets, Recursive functions and relations, subrecursive hierarchies, Semigroups of transformations, relations, partitions, etc., monoids of partial recursive functions, bi-acts, cyclic acts
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 10 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
