When is a total ordering of a semigroup a well-ordering? (Q920125)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4162952
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | When is a total ordering of a semigroup a well-ordering? |
scientific article; zbMATH DE number 4162952 |
Statements
When is a total ordering of a semigroup a well-ordering? (English)
0 references
1990
0 references
An ordered semigroup (S,\(\leq)\) is a semigroup S with an order \(\leq\) satisfying: for any s, t, and x in S, \(s\leq t\) implies sx\(\leq tx\) and xs\(\leq xt\). The order \(\leq\) is said to be positive if for all a and x in S, \(a\leq ax\) and \(a\leq xa\). This note proves the following theorem: A positive total order \(\leq\) on a semigroup S is a well-order if and only if S has a well-ordered generating set.
0 references
ordered semigroup
0 references
positive total order
0 references
well-order
0 references
0.801421046257019
0 references
0.7682874202728271
0 references
