Solution to the Problem of Zantema on a Persistent Property of Term Rewriting Systems

A property P of term rewriting systems is persistent if for any many-sorted term rewriting system R, R has the property P if and only if its underlying term rewriting system (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 sort.

• Type: Conference
• Year: 1998
• Where: PLILP
• Authors: Takahito Aoto
• Keywords: Automated Reasoning, Many-sorted Term, PLILP 1998, Term Rewriting Systems, Underlying Term