Translator Disclaimer
2012 A Simple Proof that Super-Consistency Implies Cut Elimination
Gilles Dowek, Olivier Hermant
Notre Dame J. Formal Logic 53(4): 439-456 (2012). DOI: 10.1215/00294527-1722692

Abstract

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.

Citation

Download Citation

Gilles Dowek. Olivier Hermant. "A Simple Proof that Super-Consistency Implies Cut Elimination." Notre Dame J. Formal Logic 53 (4) 439 - 456, 2012. https://doi.org/10.1215/00294527-1722692

Information

Published: 2012
First available in Project Euclid: 8 November 2012

zbMATH: 1203.03086
MathSciNet: MR2995413
Digital Object Identifier: 10.1215/00294527-1722692

Subjects:
Primary: 03F05
Secondary: 03B15, 03B99, 03C90

Rights: Copyright © 2012 University of Notre Dame

JOURNAL ARTICLE
18 PAGES


SHARE
Vol.53 • No. 4 • 2012
Back to Top