Proof Complexity of the Cut-free Calculus of Structures

DOI10.1093/LOGCOM/EXN054zbMath1175.03036OpenAlexW2141654045MaRDI QIDQ3623221

Emil Jeřábek

Publication date: 16 April 2009

Published in: Journal of Logic and Computation (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/ad159c3eb38185c160f97bbed4290164b924d32a

zbMATH Keywords

cut ruleproof complexitymonotone sequent calculuscalculus of structures

Mathematics Subject Classification ID

Cut-elimination and normal-form theorems (03F05) Complexity of proofs (03F20)

Related Items (4)

A Subatomic Proof System for Decision Trees ⋮ On the Power of Substitution in the Calculus of Structures ⋮ Extension without cut ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem

This page was built for publication: Proof Complexity of the Cut-free Calculus of Structures