source: CGBLisp/latex-doc/order.tex@ 1

\begin{lisp:documentation}{lex$>$}{FUNCTION}{p q {\sf \&optional} (start 0) (end (length p)) }
Return T if P$>$Q with respect to lexicographic order, otherwise NIL.
The second returned value is T if P=Q, otherwise it is NIL.
\end{lisp:documentation}

\begin{lisp:documentation}{total$-$degree}{FUNCTION}{m {\sf \&optional} (start 0) (end (length m)) }
Return the todal degree of a monomoal M.
\end{lisp:documentation}

\begin{lisp:documentation}{grlex$>$}{FUNCTION}{p q {\sf \&optional} (start 0) (end (length p)) }
Return T if P$>$Q with respect to graded lexicographic order,
otherwise NIL. The second returned value is T if P=Q, otherwise it is
NIL. 
\end{lisp:documentation}

\begin{lisp:documentation}{grevlex$>$}{FUNCTION}{p q {\sf \&optional} (start 0) (end (length p)) }
Return T if P$>$Q with respect to graded reverse lexicographic order,
NIL otherwise. The second returned value is T if P=Q, otherwise it is
NIL. 
\end{lisp:documentation}

\begin{lisp:documentation}{revlex$>$}{FUNCTION}{p q {\sf \&optional} (start 0) (end (length p)) }
Return T if P$>$Q with respect to reverse lexicographic order, NIL
otherwise.  The second returned value is T if P=Q, otherwise it is
NIL. This is not and admissible monomial order because some sets do
not have a minimal element. This order is useful in constructing
other orders.
\end{lisp:documentation}

\begin{lisp:documentation}{invlex$>$}{FUNCTION}{p q {\sf \&optional} (start 0) (end (length p)) }
Return T if P$>$Q with respect to inverse lexicographic order, NIL
otherwise The second returned value is T if P=Q, otherwise it is NIL.
\end{lisp:documentation}

\begin{lisp:documentation}{elimination$-$order}{FUNCTION}{k {\sf \&key} (primary$-$order \#'lex$>$) (secondary$-$order \#'lex$>$) }
Return a predicate which compares monomials according to the
K$-$th elimination order. Two optional arguments are PRIMARY$-$ORDER
and SECONDARY$-$ORDER and they should be term orders which are used
on the first K and the remaining variables.
\end{lisp:documentation}

\begin{lisp:documentation}{elimination$-$order$-$1}{FUNCTION}{order }
A special case of the ELIMINATION$-$ORDER when there is only
one primary variable.
\end{lisp:documentation}