• Enno Ohlebusch


In this chapter we will first sketch a proof of the well-known fact that termination is undecidable. In Chapter 6 this result will be strengthened in several respects. In Section 5.2 standard methods for proving termination are reviewed: Polynomial interpretations yield polynomial termination, whereas recursive path orderings show simple termination. As a matter of fact, there are several other properties related to termination that form the so-called termination hierarchy. We will review this hierarchy in Section 5.3. After that, some newer techniques for proving termination will be treated: the dependency pair method, semantic labeling, and type introduction. Finally, we will study innermost termination.


Dependency Graph Function Symbol Critical Pair Dependency Pair Weakly Monotone 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Enno Ohlebusch
    • 1
  1. 1.Research Group in Practical Computer Science, Faculty of TechnologyUniversity of BielefeldBielefeldGermany

Personalised recommendations