Persistence of Semi-Completeness for Term Rewriting Systems

M. Iwami (Japan)

Keywords

: Modelbased reasoning, Term rewriting sys tem, Semicompleteness, Persistence

Abstract

A property P is persistent if for any many-sorted term rewriting system R, R has the property P if and only if term rewriting system (R), which results from R by omitting its sort information, has the property P. 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.

Important Links:



Go Back