Obviously, this is not as trivial as using a single index's ordered list, but it can be done.
显然这并不像使用一个单一索引的有序列表那样简单,但是它可以做到。
2
In the paper we introduce the concepts of L-trivial, nil ordered semigroups and give every ordered semigroup is L-trivial if and only if the left divisibility relation is an order.