Y. Kawabe et N. Ishii, TERMINATION OF ORDER-SORTED REWRITING WITH NONMINIMAL SIGNATURES, IEICE transactions on information and systems, E81D(8), 1998, pp. 839-845
In this paper, we extend the Gnaedig's results [2],[3] on termination
of order-sorted rewriting. Gnaedig required a condition for order-sort
ed signatures, called minimality, for the termination proof. We get ri
d of this restriction by introducing a transformation from a TRS with
an arbitrary order-sorted signature to another TRS with a minimal sign
ature, and proving that this transformation preserves termination.