A Simple Proof That Super-Consistency Implies Cut Elimination

A Simple Proof That Super-Consistency Implies Cut Elimination

We give a simple and direct proof that super-consistency implies the cut elimination property in deduction modulo. This proof can be seen as a simplification of the proof that super-consistency implies proof normalization. It also takes ideas from the semantic proofs of cut elimination that proceed...

Full description

Saved in:
Bibliographic Details
Main Authors: Dowek, Gilles, Hermant, Olivier
Format: Journal Article
Language:English
Published: 21-04-2023
Subjects:
Computer Science - Logic in Computer Science
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We give a simple and direct proof that super-consistency implies the cut elimination property in deduction modulo. This proof can be seen as a simplification of the proof that super-consistency implies proof normalization. It also takes ideas from the semantic proofs of cut elimination that proceed by proving the completeness of the cut-free calculus. As an application, we compare our work with the cut elimination theorems in higher-order logic that involve V-complexes.
DOI:10.48550/arxiv.2304.10975