Dependent choice as a termination principle

02/25/2019
by   Thomas Powell, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/05/2018

Termination of λΠ modulo rewriting using the size-change principle (work in progress)

The Size-Change Termination principle was first introduced to study the ...
research
10/10/2018

DefunT: A Tool for Automating Termination Proofs by Using the Community Books (Extended Abstract)

We present a tool that automates termination proofs for recursive defini...
research
12/01/2022

Locally Adaptive Hierarchical Cluster Termination With Application To Individual Tree Delineation

A clustering termination procedure which is locally adaptive (with respe...
research
11/29/2022

Branch-Well-Structured Transition Systems and Extensions

We propose a relaxation to the definition of a well-structured transitio...
research
07/30/2020

Stopping Criterion Design for Recursive Bayesian Classification: Analysis and Decision Geometry

Systems that are based on recursive Bayesian updates for classification ...
research
02/05/2023

The Marriage of Effects and Rewrites

In the research on computational effects, defined algebraically, effect ...
research
05/12/2019

Simulation Typology and Termination Risks

The goal of the article is to explore what is the most probable type of ...

Please sign up or login with your details

Forgot password? Click here to reset