On the Computational Content of Termination Proofs

@inproceedings{Moser2015OnTC,
  title={On the Computational Content of Termination Proofs},
  author={Georg Moser and Thomas Powell},
  booktitle={Conference on Computability in Europe},
  year={2015}
}
Given that a program has been shown to terminate using a particular proof, it is natural to ask what we can infer about its complexity. In this paper we outline a new approach to tackling this question in the context of term rewrite systems and recursive path orders. From an inductive proof that recursive path orders are well-founded, we extract an explicit realiser which bounds the derivational complexity of rewrite systems compatible with these orders. We demonstrate that by analysing our… 

A proof theoretic study of abstract termination principles

A general termination principle is outlined and extracts from its wellfoundedness proof subrecursive bounds on the size of derivation trees that can be defined in Gödel’s system T plus bar recursion.

Dependent choice as a termination principle

A new formulation of the axiom of dependent choice is introduced, which can be viewed as an abstract termination principle that in particular generalises recursive path orderings and relates them to general termination theorems in the literature.

Dependent choice as a termination principle

A new formulation of the axiom of dependent choice is introduced, which can be viewed as an abstract termination principle that in particular generalises recursive path orderings and relates them to general termination theorems in the literature.

References

SHOWING 1-10 OF 17 REFERENCES

Encoding the Hydra Battle as a Rewrite System

This work constructs a rewrite system which reduces by Kruskal's theorem and whose complexity is not multiply recursive, and which is even totally terminating, leading to a new lower bound for the complexity of totally terminating rewrite systems and rewrite systems which reduce by Kruszynski's theorem.

KBOs, ordinals, subrecursive hierarchies and all that

This work shows that the known bounds on the derivation height are essentially preserved, if the rewrite system fulfils some mild conditions, and re-establish an essentially optimal 2-recursive upper bound on the derived height of finite rewrite systems compatible with a Knuth-Bendix order.

Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths

Well-Founded Recursive Relations

We give a short constructive proof of the fact that certain binary relations > are well-founded, given a lifting ≫ a la Ferreira-Zantema and a well-founded relation ▹. This construction generalizes

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma

A new analysis of the length of bad sequences over N, improving on earlier results and providing upper bounds that are essentially tight is proposed, complemented by a ``user guide'' explaining through practical examples how to easily derive complexity upper bounds from Dickson's Lemma.

Term Rewriting Theory for the Primitive Recursive Functions

On a Number Theoretic Choice Schema and its Relation to Induction

How is it that infinitary methods can be applied to finitary mathematics? Gödel's T: a case study

Abstract Inspired by Pohlers' local predicativity approach to Pure Proof Theory and Howard's ordinal analysis of bar recursion of type zero we present a short, technically smooth and constructive