−Table of Contents
Ordered monoids
Abbreviation: OMon
Definition
An \emph{ordered monoid} is a partially ordered monoid A=⟨A,⋅,1,≤⟩ such that
≤ is \emph{linear}: x≤y or y≤x
Morphisms
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, x≤y⟹h(x)≤h(y).
Examples
Example 1:
Basic results
Properties
Finite members
f(n)= number of members of size n.
f(1)=1f(2)=2f(3)=8f(4)=34f(5)=184f(6)=1218f(7)=9742f(8)=f(9)=
Subclasses
Superclasses
Ordered semigroups reduced type