Abbreviation: OMonZ
An \emph{ordered monoid with zero} is of the form A=⟨A,⋅,1,0,≤⟩ such that A=⟨A,⋅,1,≤⟩ is an ordered monoid and
0 is a \emph{zero}: x⋅0=0 and 0⋅x=0
Let A and B be ordered monoids. A morphism from A to B is a function h:A→B that is a orderpreserving homomorphism: h(x⋅y)=h(x)⋅h(y), h(1)=1, h(0)=0, x≤y⟹h(x)≤h(y).
Example 1:
Feel free to add or delete properties from this list. The list below may contain properties that are not relevant to the class that is being described.
f(n)= number of members of size n.
f(1)=1f(2)=1f(3)=3f(4)=15f(5)=84f(6)=575f(7)=4687f(8)=45223f(9)=
Ordered monoids reduced type
Ordered semigroups with zero reduced type