- Ordered semigroup
-
In mathematics, an ordered semigroup is a semigroup (S,•) together with a partial order ≤ that is compatible with the semigroup operation, meaning that x ≤ y implies z•x ≤ z•y and x•z ≤ y•z for all x, y, z in S.
If S is a group and it is ordered as a semigroup, one obtains the notion of ordered group, and similarly if S is a monoid it may be called ordered monoid.
References
- T.S. Blyth, Lattices and Ordered Algebraic Structures, Springer, 2005, ISBN 1-85233-905-5, chap. 11.
This algebra-related article is a stub. You can help Wikipedia by expanding it.