Title of article
Omega-Termination is Undecidable for Totally Terminating Term Rewriting Systems
Author/Authors
AlfonsGeser، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 1997
Pages
13
From page
399
To page
411
Abstract
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?
Journal title
Journal of Symbolic Computation
Serial Year
1997
Journal title
Journal of Symbolic Computation
Record number
805215
Link To Document