{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:46:56Z","timestamp":1725558416270},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_19","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T19:33:58Z","timestamp":1277494438000},"page":"212-225","source":"Crossref","is-referenced-by-count":13,"title":["Refined Complexity Analysis of Cut Elimination"],"prefix":"10.1007","author":[{"given":"Philipp","family":"Gerhardy","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0304-3975(91)90086-H","volume":"91","author":"W. Zhang","year":"1991","unstructured":"Zhang, W.: Cut elimination and automatic proof procedures. Theoretical Computer Science\u00a091, 265\u2013284 (1991)","journal-title":"Theoretical Computer Science"},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1016\/0304-3975(94)90087-6","volume":"129","author":"W. Zhang","year":"1994","unstructured":"Zhang, W.: Depth of proofs, depth of cut-formulas and complexity of cut formulas. Theoretical Computer Science\u00a0129, 193\u2013206 (1994)","journal-title":"Theoretical Computer Science"},{"key":"19_CR3","first-page":"868","volume-title":"Handbook of Mathematical Logic","author":"H. Schwichtenberg","year":"1977","unstructured":"Schwichtenberg, H.: Proof Theory: Some Applications of Cut-Elimination. In: Barwise, J. (ed.) Handbook of Mathematical Logic, pp. 868\u2013894. North-Holland Publishing Company, Amsterdam (1977)"},{"key":"19_CR4","first-page":"2","volume-title":"Handbook of Proof Theory","author":"S.R. Buss","year":"1998","unstructured":"Buss, S.R.: An Introduction to Proof Theory. In: Buss, S.R. (ed.) Handbook of Proof Theory, pp. 2\u201378. Elsevier Science B.V, Amsterdam (1998)"},{"key":"19_CR5","unstructured":"Luckhardt, H.: Komplexit\u00e4t der Beweistransformation bei Schnittelimination. Handwritten notes (1991)"},{"key":"19_CR6","unstructured":"Kohlenbach, U.: Notes to [5]. Handwritten notes (1995)"},{"key":"19_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0168-0072(92)90073-9","volume":"56","author":"A. Blass","year":"1992","unstructured":"Blass, A.: A game semantics for linear logic. Annals of Pure and Applied Logic\u00a056, 183\u2013220 (1992)","journal-title":"Annals of Pure and Applied Logic"},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1016\/0304-3975(84)90047-1","volume":"32","author":"J. Ketonen","year":"1984","unstructured":"Ketonen, J., Weyrauch, R.: A Decidable Fragment of Predicate Calculus. Theoretical Computer Science\u00a032, 297\u2013307 (1984)","journal-title":"Theoretical Computer Science"},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0304-3975(92)90069-R","volume":"95","author":"G. Bellin","year":"1992","unstructured":"Bellin, G., Ketonen, J.: A Decision Procedure Revisited: Notes on Direct Logic, Linear Logic and its Implementation. Theoretical Computer Science\u00a095, 115\u2013142 (1992)","journal-title":"Theoretical Computer Science"},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"104","DOI":"10.2307\/2042682","volume":"75","author":"R. Statman","year":"1979","unstructured":"Statman, R.: Lower Bounds on Herbrand\u2019s Theorem. Proc. of the Amer. Math. Soc.\u00a075, 104\u2013107 (1979)","journal-title":"Proc. of the Amer. Math. Soc."},{"key":"19_CR12","series-title":"Translations of Mathematical Monographs","doi-asserted-by":"crossref","DOI":"10.1090\/mmono\/128","volume-title":"Complexity of Proofs and Their Transformations in Axiomatic Theories","author":"V.P. Orevkov","year":"1993","unstructured":"Orevkov, V.P.: Complexity of Proofs and Their Transformations in Axiomatic Theories. Translations of Mathematical Monographs, vol.\u00a0128. American Mathematical Society, Providence (1993)"},{"key":"19_CR13","first-page":"548","volume-title":"Handbook of Proof Theory","author":"P. Pudlak","year":"1998","unstructured":"Pudlak, P.: The Length of Proofs. In: Buss, S.R. (ed.) Handbook of Proof Theory, pp. 548\u2013637. Elsevier Science B.V, Amsterdam (1998)"},{"key":"19_CR14","doi-asserted-by":"crossref","first-page":"353","DOI":"10.3233\/FI-1994-2044","volume":"20\/4","author":"M. Baaz","year":"1994","unstructured":"Baaz, M., Leitsch, A.: On Skolemizations and Proof Complexity. Fundamenta Informatica\u00a020\/4, 353\u2013379 (1994)","journal-title":"Fundamenta Informatica"},{"key":"19_CR15","doi-asserted-by":"crossref","unstructured":"Gerhardy, P.: Improved Complexity Analysis of Cut Elimination and Herbrand\u2019s Theorem. Master\u2019s thesis (2003)","DOI":"10.1007\/978-3-540-45220-1_19"},{"key":"19_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/jabr.2000.8700","volume":"242","author":"A. Carbone","year":"2001","unstructured":"Carbone, A.: Asymptotic Cyclic Expansion and Bridge Groups of Formal Proofs. Journal of Algebra\u00a0242, 109\u2013145 (2001)","journal-title":"Journal of Algebra"},{"key":"19_CR17","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1016\/S0168-0072(98)00026-8","volume":"97","author":"M. Baaz","year":"1999","unstructured":"Baaz, M., Leitsch, A.: Cut Normal Forms and Proof Complexity. Annals of Pure and Applied Logic\u00a097, 127\u2013177 (1999)","journal-title":"Annals of Pure and Applied Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,6]],"date-time":"2020-06-06T01:00:01Z","timestamp":1591405201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}