{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:37:19Z","timestamp":1742942239821,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022609"},{"type":"electronic","value":"9783642022616"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02261-6_17","type":"book-chapter","created":{"date-parts":[[2009,6,6]],"date-time":"2009-06-06T04:28:49Z","timestamp":1244262529000},"page":"209-217","source":"Crossref","is-referenced-by-count":8,"title":["Forcing-Based Cut-Elimination for Gentzen-Style Intuitionistic Sequent Calculus"],"prefix":"10.1007","author":[{"given":"Hugo","family":"Herbelin","sequence":"first","affiliation":[]},{"given":"Gyesik","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.2307\/2272955","volume":"41","author":"W. Veldman","year":"1976","unstructured":"Veldman, W.: An intuitionistic completeness theorem for intuitionistic predicate logic. J. Symb. Log.\u00a041(1), 159\u2013166 (1976)","journal-title":"J. Symb. Log."},{"key":"17_CR2","series-title":"Studies in Logic and the Foundations of Mathematics","volume-title":"Constructivism in Mathematics: An Introduction I and II","author":"A.S. Troelstra","year":"1988","unstructured":"Troelstra, A.S., van Dalen, D.: Constructivism in Mathematics: An Introduction I and II. Studies in Logic and the Foundations of Mathematics, vol.\u00a0121, 123. North-Holland, Amsterdam (1988)"},{"key":"17_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/BFb0049326","volume-title":"Computer Science Logic","author":"C. Coquand","year":"1994","unstructured":"Coquand, C.: From Semantics to Rules: A Machine Assisted Analysis. In: Meinke, K., B\u00f6rger, E., Gurevich, Y. (eds.) CSL 1993. LNCS, vol.\u00a0832, pp. 91\u2013105. Springer, Heidelberg (1994)"},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/3-540-49254-2_4","volume-title":"Prospects for Hardware Foundations","author":"U. Berger","year":"1998","unstructured":"Berger, U., Eberl, M., Schwichtenberg, H.: Normalisation by Evaluation. In: M\u00f6ller, B., Tucker, J.V. (eds.) NADA 1997. LNCS, vol.\u00a01546, pp. 117\u2013137. Springer, Heidelberg (1998)"},{"issue":"1-2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1016\/S0304-3975(02)00024-5","volume":"281","author":"M. Okada","year":"2002","unstructured":"Okada, M.: A uniform semantic proof for cut-elimination and completeness of various first and higher order logics. Theor. Comput. Sci.\u00a0281(1-2), 471\u2013498 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1017\/CBO9780511629150.011","volume-title":"Advances in Linear Logic","author":"V. Danos","year":"1995","unstructured":"Danos, V., Joinet, J.B., Schellinx, H.: LKQ and LKT: sequent calculi for second order logic based upon dual linear decompositions of the classical implication. In: Advances in Linear Logic, vol.\u00a0222, pp. 211\u2013224. Cambridge University Press, Cambridge (1995)"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.Y. Girard","year":"1987","unstructured":"Girard, J.Y.: Linear logic. Theoretical Computer Science\u00a050, 1\u2013102 (1987)","journal-title":"Theoretical Computer Science"},{"key":"17_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"190","DOI":"10.1007\/BFb0013061","volume-title":"Logic Programming and Automated Reasoning","author":"M. Parigot","year":"1992","unstructured":"Parigot, M.: Lambda-mu-calculus: An algorithmic interpretation of classical natural deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol.\u00a0624, pp. 190\u2013201. Springer, Heidelberg (1992)"},{"key":"17_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BFb0022247","volume-title":"Computer Science Logic","author":"H. Herbelin","year":"1995","unstructured":"Herbelin, H.: A Lambda-Calculus Structure Isomorphic to Gentzen-Style Sequent Calculus Structure. In: Pacholski, L., Tiuryn, J. (eds.) CSL 1994. LNCS, vol.\u00a0933, pp. 61\u201375. Springer, Heidelberg (1995)"},{"key":"17_CR10","unstructured":"Herbelin, H.: S\u00e9quents qu\u2019on calcule: de l\u2019interpr\u00e9tation du calcul des s\u00e9quents comme calcul de \u03bb-termes et comme calcul de strat\u00e9gies gagnantes. Ph.D. thesis, Universit\u00e9 Paris 7 (January 1995)"},{"issue":"1","key":"17_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2964568","volume":"24","author":"S. Kripke","year":"1959","unstructured":"Kripke, S.: A Completeness Theorem in Modal Logic. J. Symb. Log.\u00a024(1), 1\u201314 (1959)","journal-title":"J. Symb. Log."},{"key":"17_CR12","first-page":"83","volume":"16","author":"S. Kripke","year":"1963","unstructured":"Kripke, S.: Semantical considerations on modal and intuitionistic logic. Acta Philos. Fennica\u00a016, 83\u201394 (1963)","journal-title":"Acta Philos. Fennica"},{"issue":"2","key":"17_CR13","doi-asserted-by":"publisher","first-page":"139","DOI":"10.2307\/2964110","volume":"27","author":"G. Kreisel","year":"1962","unstructured":"Kreisel, G.: On Weak Completeness of Intuitionistic Predicate Logic. J. Symb. Log.\u00a027(2), 139\u2013158 (1962)","journal-title":"J. Symb. Log."},{"key":"17_CR14","series-title":"EATCS Texts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-07964-5","volume-title":"Interactive Theorem Proving and Program Development (Coq\u2019Art: The Calculus of Inductive Constructions)","author":"Y. Bertot","year":"2004","unstructured":"Bertot, Y., Cast\u00e9ran, P.: Interactive Theorem Proving and Program Development (Coq\u2019Art: The Calculus of Inductive Constructions). EATCS Texts in Theoretical Computer Science, vol.\u00a0XXV. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02261-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,25]],"date-time":"2023-05-25T15:10:42Z","timestamp":1685027442000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02261-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022609","9783642022616"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02261-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}