{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:44:21Z","timestamp":1725493461759},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540759386"},{"type":"electronic","value":"9783540759393"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-75939-3_13","type":"book-chapter","created":{"date-parts":[[2007,10,27]],"date-time":"2007-10-27T01:47:10Z","timestamp":1193449630000},"page":"201-230","source":"Crossref","is-referenced-by-count":2,"title":["Proof Transformations and Structural Invariance"],"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"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Baaz, M., Egly, U., Leitsch, A.: Normal Form Transformations. In: Handbook of Automated Reasoning, pp. 273\u2013333 (2001)","DOI":"10.1016\/B978-044450813-3\/50007-2"},{"key":"13_CR2","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"},{"issue":"2","key":"13_CR3","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(2), 149\u2013176 (2000)","journal-title":"Journal of Symbolic Computation"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1016\/j.jsc.2003.10.005","volume":"41","author":"M. Baaz","year":"2006","unstructured":"Baaz, M., Leitsch, A.: Towards a Clausal Analysis of Cut-Elimination. Journal of Symbolic Computation\u00a041, 381\u2013410 (2006)","journal-title":"Journal of Symbolic Computation"},{"issue":"3","key":"13_CR5","doi-asserted-by":"publisher","first-page":"755","DOI":"10.2307\/2275572","volume":"62","author":"V. Danos","year":"1997","unstructured":"Danos, V., Joinet, J.-B., Schellinx, H.: A New Deconstructive Logic: Linear Logic. Journal of Symbolic Logic\u00a062(3), 755\u2013807 (1997)","journal-title":"Journal of Symbolic Logic"},{"issue":"3","key":"13_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0304-3975(01)00148-7","volume":"294","author":"V. Danos","year":"2003","unstructured":"Danos, V., Joinet, J.-B., Schellinx, H.: Computational isomorphisms in classical logic. Theoretical Computer Science\u00a0294(3), 353\u2013378 (2003)","journal-title":"Theoretical Computer Science"},{"key":"13_CR7","doi-asserted-by":"crossref","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen. Mathematische Zeitschrift\u00a039, 405\u2013431 (1934\u20131935)","DOI":"10.1007\/BF01201363"},{"key":"13_CR8","first-page":"1","volume":"10","author":"S.C. Kleene","year":"1952","unstructured":"Kleene, S.C.: Permutability of Inferences in Gentzen\u2019s Calculi LK and LJ. Memoirs of the American Mathematical Society\u00a010, 1\u201326 (1952)","journal-title":"Memoirs of the American Mathematical Society"},{"key":"13_CR9","unstructured":"McKinley, R.: Categorical Model for First-Order Classical Proofs. PhD thesis, University of Bath (2006)"},{"issue":"5","key":"13_CR10","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1093\/logcom\/13.5.777","volume":"13","author":"E. Robinson","year":"2003","unstructured":"Robinson, E.: Proof Nets for Classical Logic. Journal of Logic and Computation\u00a013(5), 777\u2013797 (2003)","journal-title":"Journal of Logic and Computation"}],"container-title":["Lecture Notes in Computer Science","Algebraic and Proof-theoretic Aspects of Non-classical Logics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75939-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T13:21:32Z","timestamp":1551014492000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75939-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540759386","9783540759393"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75939-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}