Persistence of Termination for Overlay Term Rewriting Systems (Evolutionary Advancement in Fundamental Theories of Computer Science)
Munehiro Iwami · Institutional Repositories DataBase (IRDB) · 2004
Aproperty $P$ is called persistent if for any manysorted term rewriting system $\mathcal{R}$ , $\mathcal{R}$ has the prop erty $P$ if and only if term rewriting system $\Theta(\mathcal{R})$ , which results from 72 by omitting its sort informa- tion, has the property $P$ .In this paper, we show