Admissible term orderings used in computer algebra systems
Heinz Kredel · ACM SIGSAM Bulletin · 1988
Recently a discusion on correctness of Gröbner bases computation arised with H. M. Möller. We found that almost any implementation of Buchberger's algorithm to compute Gröbner bases defines and uses its own ordering of power products. We summarize the definitions of the most important ones, and include 4 examples to illustrate the differencies.