Streams and strings of formal proofs

Streams and strings of formal proofs (2002)

Cached

Download Links

[www.ihes.fr]

by A. Carbone

Venue:	THEORETICAL COMPUTER SCIENCE
Citations:	1 - 0 self

BibTeX

@ARTICLE{Carbone02streamsand,
    author = {A. Carbone},
    title = {Streams and strings of formal proofs},
    journal = {THEORETICAL COMPUTER SCIENCE},
    year = {2002},
    volume = {288}
}

Bookmark

OpenURL

Abstract

Citations

493	Untersuchungen über das logische Schließen - Gentzen - 1935
34	Bounds for proof-search and speed-up in the predicate calculus - Statman - 1978
33	The intractability of resolution. Theoret - Haken - 1985
30	bounds on Herbrand’s theorem - Statman, ‘Lower - 1979
18	The undecidability of k-provability, Ann - Buss - 1991
10	Duplication of directed graphs and exponential blow up of proofs - Carbone - 1999
8	Cycling in proofs and feasibility - Carbone - 2000
8	Proof Theory (2nd edition - Takeuti - 1987
8	On the Complexity of Derivation in the Propositional Calculus. Zapiski nauchnykh seminarov LOMI, 8:234–259 - Tseitin - 1968
7	Structural complexity of proofs - Statman - 1974
4	Asymptotic cyclic expansion and bridge groups of formal proofs - Carbone - 1998
3	The cost of a cycle is a square - Carbone - 1997
2	Interpolants, cut elimination and ow graphs - Carbone - 1997
2	A Graphic Apology for Symmetry and - Carbone, Semmes - 2000
1	Turningcycles into spirals, Ann - Carbone - 1999
1	Makingproofs without modus ponens: an introduction to the combinatorics and complexity of cut elimination - Carbone, Semmes - 1997
1	Lookingfrom the inside and the outside, Synthese 125 (2000) 385–416 - Carbone, Semmes
1	Lower bounds for increasingcomplexity of derivations after cut elimination - Orevkov - 1982