On the proof complexity of deep inference

DOI10.1145/1462179.1462186zbMath1351.03056arXiv0709.1201OpenAlexW3123028025MaRDI QIDQ2946572

Paola Bruscoli, Alessio Guglielmi

Publication date: 17 September 2015

Published in: ACM Transactions on Computational Logic (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0709.1201

zbMATH Keywords

analyticityFrege systemsdeep inferencecalculus of structuresStatman tautologies

Mathematics Subject Classification ID

Complexity of proofs (03F20)

Related Items (15)

Proof analysis of Peirce's alpha system of graphs ⋮ A cirquent calculus system with clustering and ranking ⋮ A Subatomic Proof System for Decision Trees ⋮ Contextual Natural Deduction ⋮ Implementation and Evaluation of Contextual Natural Deduction for Minimal Logic ⋮ An Analytic Propositional Proof System on Graphs ⋮ On the Power of Substitution in the Calculus of Structures ⋮ On the logical philosophy of assertive graphs ⋮ On the Proof Complexity of Cut-Free Bounded Deep Inference ⋮ A Logical Basis for Quantum Evolution and Entanglement ⋮ Maude as a Platform for Designing and Implementing Deep Inference Systems ⋮ Extension without cut ⋮ The problem of proof identity, and why computer scientists should care about Hilbert's 24th problem ⋮ Unnamed Item ⋮ True Concurrency of Deep Inference Proofs

This page was built for publication: On the proof complexity of deep inference