{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,28]],"date-time":"2025-05-28T06:25:21Z","timestamp":1748413521030},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540000105"},{"type":"electronic","value":"9783540360780"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36078-6_24","type":"book-chapter","created":{"date-parts":[[2007,5,31]],"date-time":"2007-05-31T22:48:36Z","timestamp":1180651716000},"page":"352-366","source":"Crossref","is-referenced-by-count":4,"title":["An Isomorphism between a Fragment of Sequent Calculus and an Extension of Natural Deduction"],"prefix":"10.1007","author":[{"given":"Jos\u00e9 Esp\u00edrito","family":"Santo","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,10,24]]},"reference":[{"key":"24_CR1","unstructured":"H.P. Barendregt. The Lambda Calculus. North-Holland, 1984."},{"key":"24_CR2","unstructured":"I. Cervesato and F. Pfenning. A linear spine calculus. Technical Report CMU-CS-97-125, Department of Computer Science, Carnegie Mellon University, 1997."},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"755","DOI":"10.2307\/2275572","volume":"62","author":"V. Danos","year":"1997","unstructured":"V. Danos, J-B. Joinet, and H. Schellinx. A new deconstructive logic: linear logic. The Journal of Symbolic Logic, 62(2):755\u2013807, 1997.","journal-title":"The Journal of Symbolic Logic"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1023\/A:1005099619660","volume":"60","author":"R. Dyckhoff","year":"1998","unstructured":"R. Dyckhoff and L. Pinto. Cut-elimination and a permutation-free sequent calculus for intuitionistic logic. Studia Logica, 60:107\u2013118, 1998.","journal-title":"Studia Logica"},{"key":"24_CR5","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 proofs in intuitionistic sequent calculi. Theoretical Computer Science, 212:141\u2013155, 1999.","journal-title":"Theoretical Computer Science"},{"key":"24_CR6","series-title":"Lect Notes Comput Sci","volume-title":"Proceedings of ICALP\u20192000","author":"J. E. Santo","year":"2000","unstructured":"J. Esp\u00edrito Santo. Revisiting the correspondence between cut-elimination and normalisation. In Proceedings of ICALP\u20192000, volume 1853 of Lecture Notes in Computer Science. Springer-Verlag, 2000."},{"key":"24_CR7","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":"24_CR8","unstructured":"G. Gentzen. Investigations into logical deduction. In M. E. Szabo, editor, The collected papers of Gerhard Gentzen. North Holland, 1969."},{"key":"24_CR9","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, editors, Proceedings of CSL\u201994, volume 933 of Lecture Notes in Computer Science, pages 61\u201375. Springer-Verlag, 1995."},{"key":"24_CR10","first-page":"469","volume-title":"Kreiseliana","author":"G. Mints","year":"1996","unstructured":"G. Mints. Normal forms for sequent derivations. In P. Odifreddi, editor, Kreiseliana, pages 469\u2013492. A. K. Peters, Wellesley, Massachusetts, 1996."},{"key":"24_CR11","volume-title":"Natural Deduction. A Proof-Theoretical Study","author":"D. Prawitz","year":"1965","unstructured":"D. Prawitz. Natural Deduction. A Proof-Theoretical Study. Almquist and Wiksell0, Stockholm, 1965."},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"H. Schwichtenberg. Termination of permutative conversions in intuitionistic Gentzen calculi. Theoretical Computer Science, 212, 1999.","DOI":"10.1016\/S0304-3975(98)00143-1"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"A. Troelstra and H. Schwitchtenberg. Basic Proof Theory. Cambridge University Press, second edition, 2000.","DOI":"10.1017\/CBO9781139168717"}],"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\/3-540-36078-6_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,10,4]],"date-time":"2018-10-04T10:35:54Z","timestamp":1538649354000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36078-6_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540000105","9783540360780"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-36078-6_24","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}