Abbreviation: CanSgrp
A \emph{cancellative semigroup} is a semigroup S=⟨S,⋅⟩ such that
⋅ is left cancellative: z⋅x=z⋅y⟹x=y
⋅ is right cancellative: x⋅z=y⋅z⟹x=y
Let S and T be cancellative semigroups. A morphism from S to T is a function h:S→T that is a homomorphism:
h(xy)=h(x)h(y)
Example 1: ⟨N,+⟩, the natural numbers, with additition.
f(1)=1f(2)=f(3)=f(4)=f(5)=f(6)=f(7)=