{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T11:48:57Z","timestamp":1759146537664},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540252368"},{"type":"electronic","value":"9783540322757"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32275-7_32","type":"book-chapter","created":{"date-parts":[[2010,12,20]],"date-time":"2010-12-20T21:14:41Z","timestamp":1292879681000},"page":"481-495","source":"Crossref","is-referenced-by-count":11,"title":["Cut-Elimination: Experiments with CERES"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Baaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stefan","family":"Hetzl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Leitsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Clemens","family":"Richter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"Spohr","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"32_CR1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.3233\/FI-1994-2044","volume":"20","author":"M. Baaz","year":"1994","unstructured":"Baaz, M., Leitsch, A.: On skolemization and proof complexity. Fundamenta Informaticae\u00a020(4), 353\u2013379 (1994)","journal-title":"Fundamenta Informaticae"},{"key":"32_CR2","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1006\/jsco.1999.0359","volume":"29","author":"M. Baaz","year":"2000","unstructured":"Baaz, M., Leitsch, A.: Cut-Elimination and Redundancy-Elimination by Resolution. Journal of Symbolic Computation\u00a029, 149\u2013176 (2000)","journal-title":"Journal of Symbolic Computation"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Baaz, M., Leitsch, A.: Towards a Clausal Analysis of Cut-Elimination. Journal of Symbolic Computation to appear","DOI":"10.1016\/j.jsc.2003.10.005"},{"key":"32_CR4","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/BF01201363","volume":"39","author":"G. Gentzen","year":"1934","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen. Mathematische Zeitschrift\u00a039, 405\u2013431 (1934)","journal-title":"Mathematische Zeitschrift"},{"key":"32_CR5","unstructured":"Girard, J.Y.: Proof Theory and Logical Complexity. In: Studies in Proof Theory, Bibliopolis, Napoli (1987)"},{"key":"32_CR6","doi-asserted-by":"publisher","first-page":"234","DOI":"10.2307\/2275028","volume":"54","author":"H. Luckhardt","year":"1989","unstructured":"Luckhardt, H.: Herbrand-Analysen zweier Beweise des Satzes von Roth: polynomiale Anzahlschranken. The Journal of Symbolic Logic\u00a054, 234\u2013263 (1989)","journal-title":"The Journal of Symbolic Logic"},{"key":"32_CR7","series-title":"Induction and Analogy in Mathematics","volume-title":"Mathematics and plausible reasoning","author":"G. Polya","year":"1954","unstructured":"Polya, G.: Mathematics and plausible reasoning. Induction and Analogy in Mathematics, vol.\u00a0I. Princeton University Press, Princeton (1954)"},{"key":"32_CR8","series-title":"Patterns of Plausible Inference","volume-title":"Mathematics and plausible reasoning","author":"G. Polya","year":"1954","unstructured":"Polya, G.: Mathematics and plausible reasoning. Patterns of Plausible Inference, vol.\u00a0II. Princeton University Press, Princeton (1954)"},{"key":"32_CR9","unstructured":"Urban, C.: Classical Logic and Computation. Ph.D. Thesis, University of Cambridge Computer Laboratory (2000)"},{"key":"32_CR10","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/B978-044450813-3\/50012-6","volume-title":"Handbook of Automated Reasoning","author":"A. Degtyarev","year":"2001","unstructured":"Degtyarev, A., Voronkov, A.: Equality Reasoning in Sequent-Based Calculi. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a0I, ch. 10, pp. 611\u2013706. Elsevier Science, Amsterdam (2001)"}],"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-540-32275-7_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:46:57Z","timestamp":1620013617000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32275-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540252368","9783540322757"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32275-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}