DeepAI AI Chat
Log In Sign Up

Confluence as a cut elimination property

by   Gilles Dowek, et al.

The goal of this note is to compare two notions, one coming from the theory of rewrite systems and the other from proof theory: confluence and cut elimination. We show that to each rewrite system on terms, we can associate a logical system: asymmetric deduction modulo this rewrite system and that the confluence property of the rewrite system is equivalent to the cut elimination property of the associated logical system. This equivalence, however, does not extend to rewrite systems directly rewriting atomic propositions.


page 1

page 2

page 3

page 4


Elimination and cut-elimination in multiplicative linear logic

We associate to every proof structure in multiplicative linear logic an ...

The New Normal: We Cannot Eliminate Cuts in Coinductive Calculi, But We Can Explore Them

In sequent calculi, cut elimination is a property that guarantees that a...

Subatomic systems need not be subatomic

Subatomic systems were recently introduced to identify the structural pr...

Logic of fusion

The starting point of this work is the observation that the Curry-Howard...

Cut-restriction: from cuts to analytic cuts

Cut-elimination is the bedrock of proof theory with a multitude of appli...

Transitivity of Subtyping for Intersection Types

The subtyping relation for intersection type systems traditionally emplo...

On the convergence of reduction-based and model-based methods in proof theory

In the recent past, the reduction-based and the model-based methods to p...