Comunicações por Membros do CAUL


On finite complete presentations and regular semigroups
Complete rewriting systems play an important role both in mathematics and theoretical computer science. On other hand regularity is a central concept of semigroup theory. In a joint work with R. Gray we prove that given a (von Neumann) regular semigroup with finitely many left and right ideals, if every maximal subgroup is presentable by a finite complete rewriting system, then so is the semigroup. In this talk we intend to discuss some tools and techniques used to achieve this result.
© 2010 CAUL