Termination of term rewriting, from many-sorted to one-sorted
Hans Zantema · TU/e Research Portal · 1991
A property of many-sorted term rewriting systems is called persistent if it is not affected by removing the corresponding typing restriction.Persistency turns out to be a generalization of direct sum modularity.We show that strong normalization is persistent for the class of term rewriting systems for which not both duplicating rules and collapsing rules occur, generalizing a similar result of Rusinowitch for modularity.1