{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:58:12Z","timestamp":1759147092497},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642287169"},{"type":"electronic","value":"9783642287176"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-28717-6_19","type":"book-chapter","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T10:13:04Z","timestamp":1331028784000},"page":"228-242","source":"Crossref","is-referenced-by-count":19,"title":["Towards Algorithmic Cut-Introduction"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Hetzl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Leitsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Weller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"19_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/3-540-56992-8_4","volume-title":"Computer Science Logic","author":"M. Baaz","year":"1993","unstructured":"Baaz, M., Zach, R.: Algorithmic Structuring of Cut-free Proofs. In: Martini, S., B\u00f6rger, E., Kleine B\u00fcning, H., J\u00e4ger, G., Richter, M.M. (eds.) CSL 1992. LNCS, vol.\u00a0702, pp. 29\u201342. Springer, Heidelberg (1993)"},{"issue":"5\u20136","key":"19_CR2","doi-asserted-by":"publisher","first-page":"553","DOI":"10.1093\/jigpal\/jzm040","volume":"15","author":"M. Finger","year":"2007","unstructured":"Finger, M., Gabbay, D.: Equal Rights for the Cut: Computable Non-analytic Cuts in Cut-based Proofs. Logic Journal of the IGPL\u00a015(5\u20136), 553\u2013575 (2007)","journal-title":"Logic Journal of the IGPL"},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G. Gentzen","year":"1934","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen. Mathematische Zeitschrift\u00a039, 176\u2013210, 405\u2013431 (1934\u20131935)","journal-title":"Mathematische Zeitschrift"},{"issue":"1\u20132","key":"19_CR4","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.apal.2008.10.010","volume":"159","author":"S. Hetzl","year":"2009","unstructured":"Hetzl, S.: Describing proofs by short tautologies. Annals of Pure and Applied Logic\u00a0159(1\u20132), 129\u2013145 (2009)","journal-title":"Annals of Pure and Applied Logic"},{"key":"19_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/978-3-642-28332-1_26","volume-title":"LATA 2012","author":"S. Hetzl","year":"2012","unstructured":"Hetzl, S.: Applying Tree Languages in Proof Theory. In: Dediu, A.-H., Mart\u00edn-Vide, C. (eds.) LATA 2012. LNCS, vol.\u00a07183, pp. 301\u2013312. Springer, Heidelberg (2012)"},{"key":"19_CR6","unstructured":"Hetzl, S., Leitsch, A., Weller, D.: Towards Algorithmic Cut-Introduction. technical report, \n                  \n                    http:\/\/www.logic.at\/people\/hetzl\/"},{"key":"19_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1007\/978-3-540-85110-3_38","volume-title":"Intelligent Computer Mathematics","author":"S. Hetzl","year":"2008","unstructured":"Hetzl, S., Leitsch, A., Weller, D., Woltzenlogel Paleo, B.: Herbrand Sequent Extraction. In: Autexier, S., Campbell, J., Rubio, J., Sorge, V., Suzuki, M., Wiedijk, F. (eds.) AISC\/Calculemus\/MKM 2008. LNCS (LNAI), vol.\u00a05144, pp. 462\u2013477. Springer, Heidelberg (2008)"},{"key":"19_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1007\/978-3-540-74915-8_35","volume-title":"Computer Science Logic","author":"D. Miller","year":"2007","unstructured":"Miller, D., Nigam, V.: Incorporating Tables into Proofs. In: Duparc, J., Henzinger, T.A. (eds.) CSL 2007. LNCS, vol.\u00a04646, pp. 466\u2013480. Springer, Heidelberg (2007)"},{"key":"19_CR9","first-page":"137","volume":"88","author":"V.P. Orevkov","year":"1979","unstructured":"Orevkov, V.P.: Lower bounds for increasing complexity of derivations after cut elimination. Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta\u00a088, 137\u2013161 (1979)","journal-title":"Zapiski Nauchnykh Seminarov Leningradskogo Otdeleniya Matematicheskogo Instituta"},{"key":"19_CR10","doi-asserted-by":"crossref","unstructured":"Pudl\u00e1k, P.: The Lengths of Proofs. In: Buss, S. (ed.) Handbook of Proof Theory, pp. 547\u2013637. Elsevier (1998)","DOI":"10.1016\/S0049-237X(98)80023-2"},{"key":"19_CR11","first-page":"104","volume":"75","author":"R. Statman","year":"1979","unstructured":"Statman, R.: Lower bounds on Herbrand\u2019s theorem. Proceedings of the American Mathematical Society\u00a075, 104\u2013107 (1979)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory, 2nd edn. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press (2000)","DOI":"10.1017\/CBO9781139168717"},{"key":"19_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-642-17511-4_25","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Vysko\u010dil","year":"2010","unstructured":"Vysko\u010dil, J., Stanovsk\u00fd, D., Urban, J.: Automated Proof Compression by Invention of New Definitions. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol.\u00a06355, pp. 447\u2013462. Springer, Heidelberg (2010)"},{"key":"19_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1007\/978-3-642-17511-4_26","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"B. Woltzenlogel Paleo","year":"2010","unstructured":"Woltzenlogel Paleo, B.: Atomic Cut Introduction by Resolution: Proof Structuring and Compression. In: Clarke, E.M., Voronkov, A. (eds.) LPAR-16 2010. LNCS, vol.\u00a06355, pp. 463\u2013480. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-28717-6_19.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T07:07:13Z","timestamp":1620112033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28717-6_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642287169","9783642287176"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28717-6_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}