{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:49:40Z","timestamp":1762458580516},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403326"},{"type":"electronic","value":"9783540449041"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44904-3_20","type":"book-chapter","created":{"date-parts":[[2007,10,28]],"date-time":"2007-10-28T05:49:32Z","timestamp":1193550572000},"page":"286-300","source":"Crossref","is-referenced-by-count":10,"title":["Permutative Conversions in Intuitionistic Multiary Sequent Calculi with Cuts"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Esp\u00edrito","family":"Santo","sequence":"first","affiliation":[]},{"given":"Lu\u00eds","family":"Pinto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2003,5,27]]},"reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/S0304-3975(98)00138-8","volume":"212","author":"R. Dyckhoff","year":"1999","unstructured":"R. Dyckhoff and L. Pinto, Permutability of inferences in intuitionistic sequent calculi, Theoretical Computer Science, 212 (1999) 141\u2013155.","journal-title":"Theoretical Computer Science"},{"key":"20_CR2","unstructured":"J. Esp\u00edrito Santo, Conservative extensions of the \u03bb-calculus for the computational interpretation of sequent calculus, PhD thesis, University of Edinburgh, 2002."},{"key":"20_CR3","unstructured":"J. Esp\u00edrito Santo, An isomorphism between a fragment of sequent calculus and an extension of natural deduction, in: M. Baaz and A. Voronkov (Eds.), Proc. of LPAR\u201902, 2002, Springer-Verlag, Lecture Notes in Artificial Intelligence, vol. 2514, 354\u2013366."},{"key":"20_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/BFb0022247","volume-title":"Proceedings of CSL\u201994","author":"H. Herbelin","year":"1995","unstructured":"H. Herbelin, A \u03bb-calculus structure isomorphic to a Gentzen-style sequent calculus structure, in: L. Pacholski and J. Tiuryn (Eds.), Proceedings of CSL\u201994, 1995, Springer-Verlag, Lecture Notes in Computer Science, vol. 933, 61\u201375."},{"key":"20_CR5","unstructured":"F. Joachimski and R. Matthes, Short proofs of normalisation for the simply typed \u03bb-calculus, permutative conversions and G\u00f6del\u2019s\n                        T, (accepted for publication in Archive for Mathematical Logic)."},{"key":"20_CR6","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/S0003-4843(77)80004-1","volume":"12","author":"G. Pottinger","year":"1977","unstructured":"G. Pottinger, Normalization as a homomorphic image of cut-elimination, Annals of Mathematical Logic\n                        12 (1977) 323\u2013357.","journal-title":"Annals of Mathematical Logic"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0304-3975(98)00143-1","volume":"212","author":"H. Schwichtenberg","year":"1999","unstructured":"H. Schwichtenberg, Termination of permutative conversions in intuitionistic Gentzen calculi, Theoretical Computer Science, 212 (1999) 247\u2013260.","journal-title":"Theoretical Computer Science"},{"key":"20_CR8","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/s001530100091","volume":"40","author":"J. Plato von","year":"2001","unstructured":"J. von Plato, Natural deduction with general elimination rules, Annals of Mathematical Logic, 40 (2001) 541\u2013567.","journal-title":"Annals of Mathematical Logic"},{"key":"20_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0003-4843(74)90010-2","volume":"7","author":"J. Zucker","year":"1974","unstructured":"J. Zucker, The correspondence between cut-elimination and normalization, Annals of Mathematical Logic\n                        7 (1974) 1\u2013112.","journal-title":"Annals of Mathematical Logic"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44904-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T17:42:54Z","timestamp":1551030174000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44904-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403326","9783540449041"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-44904-3_20","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}