Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems

نویسنده

Alfons Geser

چکیده

We give a complete proof of the fact that the following problem is undecidable: Given: A term rewriting system, where the termination of its rewrite relation is provable by a total reduction order on ground terms, Wanted: Does there exist a strictly monotonic interpretation in the positive integers that proves termination?

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Total Termination of Term Rewriting is Undecidable

Usually termination of term rewriting systems (TRS's) is proved by means of a mono-tonic well-founded order. If this order is total on ground terms, the TRS is called totally terminating. In this paper we prove that total termination is an undecidable property of nite term rewriting systems. The proof is given by means of Post's Correspondence Problem.

متن کامل

Simple Termination is Di cult

A terminating term rewriting system is called simply terminating if its termination can be shown by means of a simpliication ordering, an ordering with the property that a term is always bigger than its proper subterms. Almost all methods for proving termination yield, when applicable, simple termination. We show that simple termination is an undecidable property, even for one-rule systems. Thi...

متن کامل

Simple Termination Is Diicult

متن کامل

Generalized Suucient Conditions for Modular Termination of Rewriting

Modular properties of term rewriting systems, i.e. properties which are preserved under disjoint unions, have attracted an increasing attention within the last few years. Whereas connuence is modular this does not hold true in general for termination. By means of a careful analysis of potential counterexamples we prove the following abstract result. Whenever the disjoint union R1 R2 of two ((ni...

متن کامل