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

05/02/2023
by   Gilles Dowek, et al.
0

In the recent past, the reduction-based and the model-based methods to prove cut elimination have converged, so that they now appear just as two sides of the same coin. This paper details some of the steps of this transformation.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/03/2022

A theory of cut-restriction: first steps

Cut-elimination is the bedrock of proof theory. It is the algorithm that...
research
05/23/2023

Confluence as a cut elimination property

The goal of this note is to compare two notions, one coming from the the...
research
06/01/2023

Axioms vs. rewrite rules: from completeness to cut elimination

Combining a standard proof search method, such as resolution or tableaux...
research
06/22/2021

Counterexample to cut-elimination in cyclic proof system for first-order logic with inductive definitions

A cyclic proof system is a proof system whose proof figure is a tree wit...
research
04/26/2023

Cut-restriction: from cuts to analytic cuts

Cut-elimination is the bedrock of proof theory with a multitude of appli...
research
05/10/2021

No speedup for geometric theories

Geometric theories based on classical logic are conservative over their ...
research
09/16/2021

Neural-network acceleration of projection-based model-order-reduction for finite plasticity: Application to RVEs

Compared to conventional projection-based model-order-reduction, its neu...

Please sign up or login with your details

Forgot password? Click here to reset