%0 Journal Article
	%A Munehiro Iwami
	%D 2007
	%J International Journal of Mathematical and Computational Sciences
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 3, 2007
	%T Persistence of Termination for Term Rewriting Systems with Ordered Sorts
	%U https://publications.waset.org/pdf/13396
	%V 3
	%X 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 result can be extended to term rewriting systems on ordered sorts, i.e., termination is persistent for term rewriting systems on ordered sorts without collapsing, decreasing or duplicating rules. Furthermore we give the example as application of this result. Also we obtain that completeness is persistent for this class of term rewriting systems.
	%P 200 - 204