Simple Termination Is Diicult

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. This contradicts a result by Jouannaud and Kirchner. The proof is based on the ingenious construction of Dauchet who showed the undecidability of termination for one-rule systems. Our results may be summarized as follows: being simply terminating, (non-)self-embedding, and (non-)looping are undecidable properties of orthogonal, variable preserving, one-rule constructor systems.

[1]  Philip K. Hooper The undecidability of the Turing machine immortality problem , 1966, Journal of Symbolic Logic.

[2]  Gérard Huet,et al.  On the Uniform Halting Problem for Term Rewriting Systems , 1978 .

[3]  David A. Plaisted,et al.  The Undecidability of Self-Embedding for Term Rewriting Systems , 1985, Inf. Process. Lett..

[4]  Winfried Kurth,et al.  Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel , 1990 .

[5]  Anne-Cécile Caron,et al.  Linear Bounded Automata and Rewrite Systems: Influence of Initial Configurations on Decision Properties , 1991, TAPSOFT, Vol.1.

[6]  Jean-Pierre Jouannaud,et al.  Open Problems in Rewriting , 1991, RTA.

[7]  Bernhard Gramlich,et al.  A Structural Analysis of Modular Termination of Term Rewriting Systems , 1991 .

[8]  Hans Zantema,et al.  Termination of Term Rewriting by Interpretation , 1992, CTRS.

[9]  Hans Zantema,et al.  Type Removal in Term Rewriting , 1992, CTRS.

[10]  Max Dauchet,et al.  Simulation of Turing Machines by a Regular Rewrite Rule , 1992, Theor. Comput. Sci..

[11]  Azuma Ohuchi,et al.  Modularity of Simple Termination of Term Rewriting Systems with Shared Constructors , 1992, Theor. Comput. Sci..

[12]  Bernhard Gramlich Generalized Sufficient Conditions for Modular Termination of Rewriting , 1992, ALP.

[13]  E. Ohlebusch,et al.  A Note on Simple Termination of Infinite Term Rewriting Systems , 1992 .

[14]  Viggo Stoltenberg-hansen,et al.  In: Handbook of Logic in Computer Science , 1995 .

[15]  N. A C H U M D E R S H O W I T Z Termination of Rewriting' , 2022 .