A proof of the conjecture of zantema on a persistent property of term rewriting systems
Takahito Aoto · 1998
A property P of term rewriting system is persistent if for any many-sorted term rewriting system R, R has the property P iff its underlying term rewriting system 2(R), which results from R by omitting its sort information, has the property P. It is shown that termination is a persistent property of many-sorted term rewriting systems that contain only variables of the same sorts. This is the positive solution to a problem of Zantema, which has been appeared as Rewriting Open Problem 60 in literature. 1