Cycling in proofs and feasibility

Cycling in proofs and feasibility (1998)

by A. Carbone

Venue:	Transactions of the American Mathematical Society
Citations:	8 - 4 self

493	Untersuchungen über das logische Schließen – G Gentzen - 1935
10	Duplication of Directed Graphs and Exponential Blow Up of Proofs – A. Carbone - 1999
10	Making proofs without modus ponens: An introduction to the combinatorics and complexity of cut elimination – A Carbone, S Semmes - 1997
34	Bounds for proof-search and speed-up in the predicate calculus – R Statman - 1978
6	Turning Cycles into Spirals – A. Carbone - 1999
45	The Lengths of Proofs – Pavel Pudlák - 1998
19	Lower bounds for increasing complexity of derivations after cut elimination – V P Orevkov - 1982
14	Proof Theory and Logical Complexity, volume 1 – Jean-Yves Girard - 1990
25	The Undecidability of k-Provability – Samuel R. Buss - 1989
30	bounds on Herbrand’s theorem – R Statman, ‘Lower - 1979
3	The Cost of a Cycle is a Square – A. Carbone - 1999
18	The undecidability of k-provability, Ann – S R Buss - 1991
31	Interpolants, cut elimination and flow graphs for the propositional calculus – A Carbone - 1997
4	Asymptotic cyclic expansion and bridge groups of formal proofs – A. Carbone, Université De Paris Xii, Communicated J. Tits - 1998
7	Structural complexity of proofs – Richard Statman - 1974
8	A Graphic Apology for Symmetry and Implicitness – A Carbone, S Semmes - 2000
251	On the complexity of derivation in propositional calculus – G Tseitin - 1983
9	Proof Theory. Studies in Logic 81 – G Takeuti - 1987
244	The intractability of resolution – Armin Haken - 1985