−Table of Contents
Cancellative partial monoids
Abbreviation: CanPMon
Definition
A \emph{cancellative partial monoid} is a partial monoid such that
⋅ is \emph{left-cancellative}: x⋅y=x⋅z≠∗ implies y=z and
⋅ is \emph{right-cancellative}: x⋅z=y⋅z≠∗ implies x=y.
Morphisms
Let A and B be cancellative partial monoids. A morphism from A to B is a function h:A→B that is a homomorphism: h(e)=e and if x⋅y≠∗ then h(x⋅y)=h(x)⋅h(y).
Examples
Example 1:
Basic results
Properties
Finite members
See http://mathv.chapman.edu/~jipsen/uajs/CanPMon.html
$\begin{array}{lr}
f(1)= &1\\ f(2)= &2\\ f(3)= &3\\ f(4)= &9\\ f(5)= &21\\ f(6)= &125\\ f(7)= &\\ f(8)= &\\ f(9)= &\\ f(10)= &\\
\end{array}$