Persistence of Semi-Completeness for Term Rewriting Systems.
Munehiro Iwami · 2005
Abstract — A property is persistent if for any many-sorted term rewriting system, has the property if and only if term rewriting system, which results from by omitting its sort information, has the property. In this paper, we show that weak normalization is persistent for term rewriting systems. Furthermore we obtain that semi-completeness is persistent for term rewriting systems and we give the example as application of this result. Keywords: Theory of computing, Model-based reasoning, Term rewriting system, Semi-completeness