A Simple Proof That Super-Consistency Implies Cut Elimination

DOI10.1007/978-3-540-73449-9_9zbMath1203.03086OpenAlexW1543241473MaRDI QIDQ5432335

Olivier Hermant, Gilles Dowek

Publication date: 2 January 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73449-9_9

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Cut-elimination and normal-form theorems (03F05)

Related Items (4)

Orthogonality and Boolean Algebras for Deduction Modulo ⋮ A simple proof that super-consistency implies cut elimination ⋮ Axiom Directed Focusing ⋮ On the Convergence of Reduction-based and Model-based Methods in Proof Theory

This page was built for publication: A Simple Proof That Super-Consistency Implies Cut Elimination