{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,3]],"date-time":"2024-02-03T00:04:36Z","timestamp":1706918676541},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2006,2,1]],"date-time":"2006-02-01T00:00:00Z","timestamp":1138752000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[2006,2]]},"DOI":"10.1007\/s11225-006-6607-2","type":"journal-article","created":{"date-parts":[[2006,2,2]],"date-time":"2006-02-02T01:59:07Z","timestamp":1138845547000},"page":"95-119","source":"Crossref","is-referenced-by-count":29,"title":["Towards a Semantic Characterization of Cut-Elimination"],"prefix":"10.1007","volume":"82","author":[{"given":"Agata","family":"Ciabattoni","sequence":"first","affiliation":[]},{"given":"Kazushige","family":"Terui","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6607_CR1","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1002\/malq.19900360405","volume":"36","author":"V. M. Abrusci","year":"1990","unstructured":"Abrusci, V. M., \u2018Non-commutative intuitionistic linear Propositional logic\u2019, Zeit-schrift fur Mathematische Logik und Grundlagen der Mathematik 36: 297\u2013318, 1990.","journal-title":"Zeit-schrift fur Mathematische Logik und Grundlagen der Mathematik"},{"key":"6607_CR2","doi-asserted-by":"crossref","unstructured":"Avron, A., and I. Lev, \u2018Canonical Propositional Gentzen-Type Systems\u2019, Proceedings of IJCAR'01, vol. 2083 LNCS, 2001, pp. 529\u2013543.","DOI":"10.1007\/3-540-45744-5_45"},{"key":"6607_CR3","first-page":"1","volume":"68","author":"F. Belardinelli","year":"2001","unstructured":"Belardinelli, F., H. Ono, and P. Jipsen, \u2018Algebraic aspects of cut elimination\u2019, Studia Logica 68: 1\u201332, 2001.","journal-title":"Studia Logica"},{"issue":"4","key":"6607_CR4","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF00284976","volume":"11","author":"N. D. Belnap Jr.","year":"1982","unstructured":"Belnap, N. D., Jr., \u2018Display Logic\u2019, Journal of Philosophical Logic, 11(4):375\u2013417, 1982.","journal-title":"Journal of Philosophical Logic"},{"key":"6607_CR5","doi-asserted-by":"crossref","unstructured":"Buss, S., \u2018An Introduction to Proof Theory\u2019, Handbook of Proof Theory, Elsevier Science, 1998, pp. 1\u201378.","DOI":"10.1016\/S0049-237X(98)80016-5"},{"key":"6607_CR6","doi-asserted-by":"crossref","unstructured":"Ciabattoni, A., \u2018Automated Generation of Analytic Calculi for Logics with Linearity\u2019, Proceedings of CSL'04, vol. 3210 LNCS, 2004, pp. 503\u2013517.","DOI":"10.1007\/978-3-540-30124-0_38"},{"key":"6607_CR7","doi-asserted-by":"crossref","unstructured":"Gentzen, G., \u2018Untersuchungen\u00fcber das Logische Schliessen\u2019, Math. Zeitschrift 39: 176\u2013210, 405\u2013431, 1935.","DOI":"10.1007\/BF01201363"},{"key":"6607_CR8","unstructured":"Girard, J.-Y., \u2018Three valued logics and cut-elimination: the actual meaning of Takeuti's conjecture\u2019, Dissertationes Mathematicae 136: 1\u201349, 1976."},{"key":"6607_CR9","unstructured":"Girard, J.-Y., Proof Theory and Logical Complexity, Bibliopolis, 1987."},{"key":"6607_CR10","unstructured":"Girard, J.-Y., Y. Lafont, and P. Taylor, Proofs and Types, Cambridge University Press, 1989."},{"key":"6607_CR11","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/978-3-642-58622-4_7","volume-title":"Computational Logic","author":"J.-Y. Girard","year":"1999","unstructured":"Girard, J.-Y., \u2018On the meaning of logical rules I: syntax vs. semantics\u2019, in U. Berger and H. Schwichtenberg, (eds.), Computational Logic, Heidelberg Springer-Verlag, 1999, pp. 215\u2013272."},{"issue":"2","key":"6607_CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1305\/ndjfl\/1094061862","volume":"35","author":"R. Hori","year":"1994","unstructured":"Hori, R., H. Ono, and H. Schellinx, \u2018Extending intuitionistic linear logic with knotted structural rules\u2019, Notre Dame Journal of Formal Logic 35(2):219\u2013242, 1994.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"6607_CR13","unstructured":"Miller, D., and E. Pimentel, \u2018Using Linear Logic to reason about sequent systems\u2019, Proceedings of Tableaux'02, vol. 2381 LNCS, 2002, pp. 2\u201323."},{"key":"6607_CR14","doi-asserted-by":"crossref","unstructured":"Okada, M., \u2018Phase semantics for higher order completeness, cut-elimination and normalization proofs (extended abstract)\u2019, in J.-Y. Girard, M. Okada, and A. Scedrov, (eds.), ENTCS (Electronic Notes in Theoretical Computer Science) vol.3: A Special Issue on the Linear Logic 96, Tokyo Meeting, Elsevier-ENTCS, 1996.","DOI":"10.1016\/S1571-0661(05)80414-1"},{"key":"6607_CR15","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/S0304-3975(99)00058-4","volume":"227","author":"M. Okada","year":"1999","unstructured":"Okada, M., \u2018Phase semantic cut-elimination and normalization proofs of first- and higher-order linear logic\u2019, Theoretical Computer Science 227: 333\u2013396, 1999.","journal-title":"Theoretical Computer Science"},{"key":"6607_CR16","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1016\/S0304-3975(02)00024-5","volume":"281","author":"M. Okada","year":"2002","unstructured":"Okada, M., \u2018A uniform semantic proof for cut-elimination and completeness of various first and higher order logics\u2019, Theoretical Computer Science 281: 471\u2013498, 2002.","journal-title":"Theoretical Computer Science"},{"key":"6607_CR17","doi-asserted-by":"crossref","unstructured":"Ono, H., \u2018Semantics for substructural logics\u2019, in K. Dosen and P. Schroder-Heister, (eds.), Substructural logics, Oxford University Press, 1994, pp. 259\u2013291.","DOI":"10.1093\/oso\/9780198537779.003.0010"},{"key":"6607_CR18","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1007\/BF00370844","volume":"57","author":"A. Prijatelj","year":"1996","unstructured":"Prijatelj, A., \u2018Bounded Contraction and Gentzen style Formulation of Lukasiewicz Logics\u2019, Studia Logica 57: 437\u2013456, 1996.","journal-title":"Studia Logica"},{"key":"6607_CR19","volume-title":"An Introduction to Substructural Logics","author":"G. Restall","year":"1999","unstructured":"Restall, G., An Introduction to Substructural Logics, Routledge, London, 1999."},{"key":"6607_CR20","unstructured":"Schwichtenberg, H., and A. S. Troelstra, Basic Proof Theory (2nd Edition). Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, 2000."},{"key":"6607_CR21","unstructured":"Terui, K., \u2018Which Structural Rules Admit Cut Elimination? \u2014 An Algebraic Criterion\u2019, Submitted. Available at research.nii.ac.jp\/~terui\/cut.pdf."},{"key":"6607_CR22","unstructured":"Troelstra, A. S., Lectures on Linear Logic, CSLI Lecture Notes 29, Center for the Study of Language and Information, Stanford, California, 1992."}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-006-6607-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11225-006-6607-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-006-6607-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,2]],"date-time":"2024-02-02T17:45:42Z","timestamp":1706895942000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11225-006-6607-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,2]]},"references-count":22,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,2]]}},"alternative-id":["6607"],"URL":"https:\/\/doi.org\/10.1007\/s11225-006-6607-2","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"value":"0039-3215","type":"print"},{"value":"1572-8730","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,2]]}}}