Abstract

In this paper we investigate the concept of simple termination. A term rewriting system (TRS for short) is called simply terminating if its termination can be proved by means of a simplification order. We propose a new definition of simplification order and we investigate the properties of the resulting class of simply terminating systems.

BibTeX Entry

@article{MZ-BSL95,
 author    = "Aart Middeldorp and Hans Zantema",
 title     = "Simple Termination of Rewrite Systems",
 journal   = "Bulletin of the Section of Logic",
 volume    = 24,
 number    = 1,
 pages     = "31--36",
 year      = 1995
}