加载中…
We prove that if is a recursive set of primes, then pointlike sets are decidable for the pseudovariety of semigroups whose subgroups are -groups. In particular, when is the empty set, we obtain Henckell’s decidability of aperiodic pointlikes. Our proof, restricted to the case of aperiodic semigroups, is simpler than the original proof.

生成讲解博客的中文版本

生成AI智能校验的中文版本