Pointlike sets with respect to ER
classification
🧮 math.GR
math.RA
keywords
finitepointlikesetscomputesconstructivedecidableer-pointlikeexplicit
read the original abstract
We show that pointlike sets are decidable for the pseudovariety of finite semigroups whose idempotent-generated subsemigroup is R-trivial. Notably, our proof is constructive: we provide an explicit relational morphism which computes the ER-pointlike subsets of a given finite semigroup.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.