Solution to the Problem of Zantema on a PersistentProperty of Term Rewriting Systems

摘要

A property P of term rewriting systems is persistentif for any many-sorted term rewriting system R,R has the property P if and only if its underlying term rewriting system Theta(R),which results from R by omitting its sort information,has the property P.It is shown that termination is a persistent property ofmany-sorted term rewriting systems that contain only variables of the same sort.