Munehiro Iwami

  • Citations Per Year
Learn More
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 . Zantema showed that termination is persistent for term rewriting systems without collapsing or duplicating rules. In this paper, we show that the Zantema’s(More)
A property is called persistent if for any manysorted 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 termination is persistent for right-linear overlay term rewriting systems and we give the example as application of this(More)
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(More)
  • 1