The embeddability of ring and semigroup amalgams is undecidable Academic Article uri icon


  • AbstractWe prove that there is no algorithm to determine when an amalgam of finite rings (or semigroups) can be embedded in the class of rings or in the class of finite rings (respectively, in the class of semigroups or in the class of finite semigroups). These results are in marked contrast with the corresponding problems for groups where every amalgam of finite groups can be embedded in a finite group.

publication date

  • October 2000