{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T09:38:19Z","timestamp":1648633099020},"reference-count":20,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00145-1","type":"journal-article","created":{"date-parts":[[2002,10,9]],"date-time":"2002-10-09T15:39:34Z","timestamp":1034177974000},"page":"45-83","source":"Crossref","is-referenced-by-count":5,"title":["Streams and strings in formal proofs"],"prefix":"10.1016","volume":"288","author":[{"given":"A.","family":"Carbone","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00145-1_BIB1","doi-asserted-by":"crossref","first-page":"72","DOI":"10.1016\/0168-0072(91)90059-U","article-title":"The undecidability of k-provability","volume":"53","author":"Buss","year":"1991","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(01)00145-1_BIB2","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/S0168-0072(96)00019-X","article-title":"Interpolants, cut elimination and flow graphs","volume":"83","author":"Carbone","year":"1997","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(01)00145-1_BIB3","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/S0168-0072(98)00031-1","article-title":"Turning cycles into spirals","volume":"96","author":"Carbone","year":"1999","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(01)00145-1_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0168-0072(99)00009-3","article-title":"Duplication of directed graphs and exponential blow up of proofs","volume":"100","author":"Carbone","year":"1999","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0304-3975(01)00145-1_BIB5","doi-asserted-by":"crossref","first-page":"2049","DOI":"10.1090\/S0002-9947-99-02300-4","article-title":"Cycling in proofs and feasibility","volume":"352","author":"Carbone","year":"2000","journal-title":"Trans. Am. Math. Soc."},{"key":"10.1016\/S0304-3975(01)00145-1_BIB6","unstructured":"A. Carbone, The cost of a cycle is a square, J. Symbolic Logic, 2001, to appear."},{"key":"10.1016\/S0304-3975(01)00145-1_BIB7","doi-asserted-by":"crossref","unstructured":"A. Carbone, Asymptotic cyclic expansion and bridge groups of formal proofs, J. Algebra, 2001, to appear.","DOI":"10.1006\/jabr.2000.8700"},{"key":"10.1016\/S0304-3975(01)00145-1_BIB8","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1090\/S0273-0979-97-00715-5","article-title":"Making proofs without modus ponens: an introduction to the combinatorics and complexity of cut elimination","volume":"34","author":"Carbone","year":"1997","journal-title":"Bull. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(01)00145-1_BIB9","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1023\/A:1005244027724","article-title":"Looking from the inside and the outside","volume":"125","author":"Carbone","year":"2000","journal-title":"Synth\u00e8se"},{"key":"10.1016\/S0304-3975(01)00145-1_BIB10","series-title":"A Graphic Apology for Symmetry and Implicitness \u2013 Combinatorial Complexity of Proofs, Languages and Geometric Constructions. Mathematical Monographs","author":"Carbone","year":"2000"},{"key":"10.1016\/S0304-3975(01)00145-1_BIB11","doi-asserted-by":"crossref","unstructured":"G. Gentzen, Untersuchungen \u00fcber das logische Schlie\u00dfen I\u2013II, Math. Z. 39 (1934) 176\u2013210, 405\u2013431.","DOI":"10.1007\/BF01201353"},{"key":"10.1016\/S0304-3975(01)00145-1_BIB12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","article-title":"Linear logic","volume":"50","author":"Girard","year":"1987","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(01)00145-1_BIB13","series-title":"Proof Theory and Logical Complexity","volume":"Vol. 1","author":"Girard","year":"1987"},{"key":"10.1016\/S0304-3975(01)00145-1_BIB14","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1016\/0304-3975(85)90144-6","article-title":"The intractability of resolution","volume":"39","author":"Haken","year":"1985","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"10.1016\/S0304-3975(01)00145-1_BIB15","doi-asserted-by":"crossref","DOI":"10.1007\/BF01629444","article-title":"Lower bounds for increasing complexity of derivations after cut elimination","volume":"20","author":"Orevkov","year":"1982","journal-title":"J. Sov. Math."},{"key":"10.1016\/S0304-3975(01)00145-1_BIB16","unstructured":"R. Statman, Structural complexity of proofs, Ph.D. Thesis, Stanford University, 1974."},{"key":"10.1016\/S0304-3975(01)00145-1_BIB17","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/0003-4843(78)90011-6","article-title":"Bounds for proof-search and speed-up in predicate calculus","volume":"15","author":"Statman","year":"1978","journal-title":"Ann. Math. Logic"},{"key":"10.1016\/S0304-3975(01)00145-1_BIB18","first-page":"104","article-title":"Lower bounds on Herbrand's Theorem","volume":"75","author":"Statman","year":"1979","journal-title":"Proc. Am. Math. Soc."},{"key":"10.1016\/S0304-3975(01)00145-1_BIB19","series-title":"Proof Theory","volume":"Vol. 81","author":"Takeuti","year":"1987"},{"key":"10.1016\/S0304-3975(01)00145-1_BIB20","first-page":"234","article-title":"Complexity of a derivation in the propositional calculus","volume":"8","author":"Tseitin","year":"1968","journal-title":"Zap. Nauchn. Sem. Leningrad Otd. Mat. Inst. Akad. Nauk SSSR"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001451?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501001451?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T03:39:12Z","timestamp":1554781152000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501001451"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501001451"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00145-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,10]]}}}