{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T06:35:00Z","timestamp":1780382100126,"version":"3.54.1"},"reference-count":18,"publisher":"Elsevier BV","issue":"49","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,16]],"date-time":"2013-07-16T00:00:00Z","timestamp":1373932800000},"content-version":"vor","delay-in-days":623,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/3.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1016\/j.tcs.2011.08.035","type":"journal-article","created":{"date-parts":[[2011,9,2]],"date-time":"2011-09-02T22:15:46Z","timestamp":1315001746000},"page":"6843-6854","source":"Crossref","is-referenced-by-count":2,"title":["On the elimination of quantifier-free cuts"],"prefix":"10.1016","volume":"412","author":[{"given":"Daniel","family":"Weller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.tcs.2011.08.035_br000005","doi-asserted-by":"crossref","first-page":"353","DOI":"10.3233\/FI-1994-2044","article-title":"Skolemization and proof complexity","volume":"20","author":"Baaz","year":"1994","journal-title":"Fundamenta Informaticae"},{"key":"10.1016\/j.tcs.2011.08.035_br000010","series-title":"Logic and Computational Complexity","first-page":"195","article-title":"On Herbrand\u2019s theorem","volume":"vol. 960","author":"Buss","year":"1995"},{"key":"10.1016\/j.tcs.2011.08.035_br000015","series-title":"Handbook of Proof Theory","first-page":"1","article-title":"An introduction to proof theory","author":"Buss","year":"1998"},{"issue":"1","key":"10.1016\/j.tcs.2011.08.035_br000020","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/BF01201353","article-title":"Untersuchungen \u00fcber das logische Schlie\u00dfen I","volume":"39","author":"Gentzen","year":"1935","journal-title":"Mathematische Zeitschrift"},{"key":"10.1016\/j.tcs.2011.08.035_br000025","series-title":"Computer Science Logic","first-page":"212","article-title":"Refined complexity analysis of cut elimination","volume":"vol. 2803","author":"Gerhardy","year":"2003"},{"issue":"2","key":"10.1016\/j.tcs.2011.08.035_br000030","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1305\/ndjfl\/1117755147","article-title":"The role of quantifier alternations in cut elimination","volume":"46","author":"Gerhardy","year":"2005","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"10.1016\/j.tcs.2011.08.035_br000035","unstructured":"Willem Heijltjes, Proof forests with cut-elimination based on Herbrand\u2019s theorem, in: Second International Workshop on Classical Logic and Computation, July 2008."},{"issue":"1\u20132","key":"10.1016\/j.tcs.2011.08.035_br000040","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.apal.2008.10.010","article-title":"Describing proofs by short tautologies","volume":"159","author":"Hetzl","year":"2009","journal-title":"Annals of Pure and Applied Logic"},{"issue":"1","key":"10.1016\/j.tcs.2011.08.035_br000045","doi-asserted-by":"crossref","first-page":"73","DOI":"10.2307\/2275250","article-title":"Lower bounds to the size of constant-depth propositional proofs","volume":"59","author":"Kraj\u00ed\u010dek","year":"1994","journal-title":"Journal of Symbolic Logic"},{"key":"10.1016\/j.tcs.2011.08.035_br000050","unstructured":"Richard McKinley, Herbrand expansion proofs and proof identity, in: Second International Workshop on Classical Logic and Computation, July 2008."},{"key":"10.1016\/j.tcs.2011.08.035_br000055","unstructured":"Dale Miller, Proofs In Higher-Order Logic, Ph.D. thesis, Carnegie Mellon University, Department of Mathematics, 1983."},{"issue":"4","key":"10.1016\/j.tcs.2011.08.035_br000060","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/BF00370646","article-title":"A compact representation of proofs","volume":"46","author":"Miller","year":"1987","journal-title":"Studia Logica"},{"key":"10.1016\/j.tcs.2011.08.035_br000065","series-title":"Basic Proof Theory","author":"Troelstra","year":"2000"},{"issue":"4","key":"10.1016\/j.tcs.2011.08.035_br000070","doi-asserted-by":"crossref","first-page":"425","DOI":"10.2178\/bsl\/1203350879","article-title":"The complexity of propositional proofs","volume":"1","author":"Urquhart","year":"1995","journal-title":"The Bulletin of Symbolic Logic"},{"key":"10.1016\/j.tcs.2011.08.035_br000075","series-title":"Herbrand Sequent Extraction","author":"Woltzenlogel Paleo","year":"2008"},{"key":"10.1016\/j.tcs.2011.08.035_br000080","unstructured":"Bruno Woltzenlogel Paleo, A General Analysis of Cut-Elimination by CERes, Ph.D. thesis, Vienna University of Technology, 2009."},{"issue":"2","key":"10.1016\/j.tcs.2011.08.035_br000085","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/0304-3975(91)90086-H","article-title":"Cut elimination and automatic proof procedures","volume":"91","author":"Zhang","year":"1991","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"10.1016\/j.tcs.2011.08.035_br000090","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1016\/0304-3975(94)90087-6","article-title":"Depth of proofs, depth of cut-formulas and complexity of cut-formulas","volume":"129","author":"Zhang","year":"1994","journal-title":"Theoretical Computer Science"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511007390?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397511007390?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,6,23]],"date-time":"2020-06-23T03:19:44Z","timestamp":1592882384000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397511007390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":18,"journal-issue":{"issue":"49","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["S0304397511007390"],"URL":"https:\/\/doi.org\/10.1016\/j.tcs.2011.08.035","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2011,11]]}}}