{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:00:45Z","timestamp":1725483645803},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657637"},{"type":"electronic","value":"9783540489597"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48959-2_26","type":"book-chapter","created":{"date-parts":[[2007,5,3]],"date-time":"2007-05-03T16:52:16Z","timestamp":1178211136000},"page":"365-380","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Strong Normalisation of Cut-Elimination in Classical Logic"],"prefix":"10.1007","author":[{"given":"C.","family":"Urban","sequence":"first","affiliation":[]},{"given":"G. M.","family":"Bierman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,5,27]]},"reference":[{"key":"26_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/3-540-57887-0_112","volume-title":"Proc. of Theoretical Aspects of Computer Software","author":"F. Barbanera","year":"1994","unstructured":"F. Barbanera and S. Berardi. A Symmetric Lambda Calculus for \u201cClassical\u201d Program Extraction. In Proc. of Theoretical Aspects of Computer Software, volume 789 of LNCS, pages 495\u2013515. Springer Verlag, 1994."},{"unstructured":"H. Barendregt. The Lambda Calculus-Its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Company, 1981.","key":"26_CR2"},{"unstructured":"G. Bierman. Some Lectures on Proof Theory. Notes from course given at PUC-Rio, November 1997.","key":"26_CR3"},{"unstructured":"E. T. Bittar. Strong Normalisation Proofs for Cut Elimination in Gentzen\u2019s Sequent Calculi. In Proc. of the Symposium: Logic, Algebra and Computer Science, Warsaw, December 1996.","key":"26_CR4"},{"unstructured":"E. A. Cichon, M. Rusinowitch, and S. Selhab. Cut Elimination and Rewriting: Termination Proofs. Theoretical Computer Science, 1996. (to appear).","key":"26_CR5"},{"issue":"3","key":"26_CR6","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. Journal of Symbolic Logic, 62(3):755\u2013807, Sept. 1997.","journal-title":"Journal of Symbolic Logic"},{"key":"26_CR7","volume-title":"Mathematical Intuitionism","author":"A. G. Dragalin","year":"1988","unstructured":"A. G. Dragalin. Mathematical Intuitionism, volume 67. American Mathematical Society, Providence, Rhode Island, 1988."},{"key":"26_CR8","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"},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0304-3975(93)90011-H","volume":"110","author":"J. Gallier","year":"1993","unstructured":"J. Gallier. Constructive Logics. Part I: A Tutorial on Proof Systems and Typed \u03bb-Calculi. Theoretical Computer Science, 110(2):249\u2013239, 1993.","journal-title":"Theoretical Computer Science"},{"key":"26_CR10","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G. Gentzen","year":"1935","unstructured":"G. Gentzen. Untersuchungen \u00fcber das logische Schlieffen I and II. Mathematische Zeitschrift, 39:176\u2013210, 405\u2013431, 1935.","journal-title":"Mathematische Zeitschrift"},{"key":"26_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"J.-Y. Girard. Linear Logic. Theoretical Computer Science, 50:1\u2013102, 1987.","journal-title":"Theoretical Computer Science"},{"unstructured":"J.-Y. Girard, Y. Lafont, and P. Taylor. Proofs and Types. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.","key":"26_CR12"},{"key":"26_CR13","first-page":"95","volume":"154","author":"E. H. Hauesler","year":"1996","unstructured":"E. H. Hauesler and L. C. Pereira. Gentzen\u2019s Second Consistency Proof and Strong Cut-Elimination. Logique and Analyse, 154:95\u2013111, 1996.","journal-title":"Logique and Analyse"},{"key":"26_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/BFb0022247","volume-title":"Proc. of the Conference on Computer Science Logic","author":"H. Herbelin","year":"1995","unstructured":"H. Herbelin. A \u03bb-Calculus Structure Isomorphic to Sequent Calculus Structure. In Proc. of the Conference on Computer Science Logic, volume 933 of LNCS, pages 67\u201375. Springer Verlag, 1995."},{"unstructured":"J.-B. Joinet, H. Schellinx, and L. Tortora de Falco. SN and CR for Free-Style LK\n                           \n                    tq\n                  : Linear Decorations and Simulation of Normalisation. Technical Report, May 1998.","key":"26_CR15"},{"key":"26_CR16","volume-title":"Introduction to Metamathematics","author":"S. C. Kleene","year":"1952","unstructured":"S. C. Kleene. Introduction to Metamathematics. North-Holland Publishing Company, Amsterdam, 1952."},{"key":"26_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Proc. of the Int. Conference on Logic Programming and Automated Deduction","author":"M. Parigot","year":"1992","unstructured":"M. Parigot. \u03bb\u03bc-Calculus: An Algorithmic Interpretation of Classical Logic. In Proc. of the Int. Conference on Logic Programming and Automated Deduction, volume 624 of LNCS, pages 190\u2013201. Springer Verlag, 1992."},{"unstructured":"A. S. Troelstra and H. Schwichtenberg. Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1996.","key":"26_CR18"},{"unstructured":"C. Urban. First-Year Report: Computational Content of Classical Proofs. Technical Report, 1997.","key":"26_CR19"},{"key":"26_CR20","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 Correspondance Between Cut-Elimination and Normalisation. Annals of Mathematical Logic, 7:1\u2013112, 1974.","journal-title":"Annals of Mathematical Logic"}],"container-title":["Lecture Notes in Computer Science","Typed Lambda Calculi and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48959-2_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:06:58Z","timestamp":1558271218000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48959-2_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657637","9783540489597"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-48959-2_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"27 May 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}