%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 Non-Overlapping Term Rewriting Systems
	%U https://publications.waset.org/pdf/12721
	%V 3
	%X A property is called 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 termination is persistent for non-overlapping term rewriting systems and we give the example as application of this result. Furthermore we obtain that completeness is persistent for non-overlapping term rewriting systems.
	%P 205 - 208