Duplication of Directed Graphs and Exponential Blow Up of Proofs (1999)

by A. Carbone
Citations:11 - 3 self

Documents Related by Co-Citation

565 Untersuchungen über das logische Schließen – G Gentzen - 1935
330 The relative efficiency of propositional proof systems – Stephen A. Cook, Robert, A. Reckhow - 1979
8 Cycling in proofs and feasibility – A. Carbone - 1998
37 Bounds for proof-search and speed-up in the predicate calculus – Richard Statman - 1978
50 The Lengths of Proofs – Pavel Pudlák - 1998
9 Depth of proofs, depth of cut-formulas and complexity of cut formulas – W Zhang - 1994
10 Making proofs without modus ponens: An introduction to the combinatorics and complexity of cut elimination – A Carbone, S Semmes - 1997
31 Interpolants, cut elimination and flow graphs for the propositional calculus – A Carbone - 1997
59 Intuitionistic propositional logic is polynomial-space complete – Richard Statman - 1979
3 The Cost of a Cycle is a Square – A. Carbone - 1999
5 Asymptotic cyclic expansion and bridge groups of formal proofs – A. Carbone - 2001
6 Turning Cycles into Spirals – A. Carbone - 1999
21 Lower bounds for increasing complexity of derivations after cut elimination – V P Orevkov - 1979
14 Proof Theory and Logical Complexity, volume 1 – J-Y Girard - 1987
27 The Undecidability of k-Provability – Samuel R. Buss - 1989
8 A Graphic Apology for Symmetry and Implicitness – A Carbone, S Semmes - 2000
303 On the complexity of derivation in propositional calculus – Grigori Tseitin - 1968
6 Lower bounds for lengthening of proofs after cut-elimination – V P Orevkov - 1982
107 Display logic – N D Belnap - 1982