Dependent choice as a termination principle
Logic in Computer Science
2019-02-28 v1 Logic
Abstract
We introduce a new formulation of the axiom of dependent choice that can be viewed as an abstract termination principle, which generalises the recursive path orderings used to establish termination of rewrite systems. We consider several variants of our termination principle, and relate them to general termination theorems in the literature.
Cite
@article{arxiv.1902.09539,
title = {Dependent choice as a termination principle},
author = {Thomas Powell},
journal= {arXiv preprint arXiv:1902.09539},
year = {2019}
}