Persistence of Termination for Non-Overlapping Term Rewriting Systems (Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory)
Munehiro Iwami · Institutional Repositories DataBase (IRDB) · 2004
A property $P$ is called persistent if for any many-sorted term rewriting system 72, 72 has the property $P$ if and only if term rewriting system $\Theta(\mathcal{R})$ , which results from 72 by omitting its sort information, has the property $P$ .In this paper, we show that termination is persistent for non-0verlapping term rewriting systems and we give example as application of this result.Furthermore we obtain that completeness is persistent for non-0verlapping term rewriting systems.