{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T12:22:07Z","timestamp":1763641327636},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642040269"},{"type":"electronic","value":"9783642040276"}],"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-04027-6_14","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T17:27:52Z","timestamp":1252949272000},"page":"163-178","source":"Crossref","is-referenced-by-count":13,"title":["Expanding the Realm of Systematic Proof Theory"],"prefix":"10.1007","author":[{"given":"Agata","family":"Ciabattoni","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Stra\u00dfburger","sequence":"additional","affiliation":[]},{"given":"Kazushige","family":"Terui","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"14_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.-M. Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"14_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01531058","volume":"4","author":"A. Avron","year":"1991","unstructured":"Avron, A.: Hypersequents, logical consequence and intermediate logics for concurrency. Ann. Math. Artif. Intell.\u00a04, 225\u2013248 (1991)","journal-title":"Ann. Math. Artif. Intell."},{"key":"14_CR3","unstructured":"Ciabattoni, A., Galatos, N., Terui, K.: Algebraic proof theory for substructural logics: Cut-elimination and completions (2008) (submitted)"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Ciabattoni, A., Galatos, N., Terui, K.: From axioms to analytic rules in nonclassical logics. In: LICS, pp. 229\u2013240 (2008)","DOI":"10.1109\/LICS.2008.39"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/s11225-005-4647-7","volume":"81","author":"J. Gispert","year":"2005","unstructured":"Gispert, J., Torrens, A.: Axiomatic extensions of IMT3 logic. Studia Logica\u00a081(3), 311\u2013324 (2005)","journal-title":"Studia Logica"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Houston, R.: Finite products are biproducts in a compact closed category. Journal of Pure and Applied Algebra\u00a0212(2) (2008)","DOI":"10.1016\/j.jpaa.2007.05.021"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-94-017-2798-3_7","volume-title":"Proof theory of modal logic","author":"M. Kracht","year":"1996","unstructured":"Kracht, M.: Power and weakness of the modal display calculus. In: Proof theory of modal logic, pp. 93\u2013121. Kluwer, Dordrecht (1996)"},{"key":"14_CR8","unstructured":"Lamarche, F.: On the algebra of structural contexts. Accepted at Mathematical Structures in Computer Science (2001)"},{"key":"14_CR9","first-page":"241","volume-title":"Proceedings of the Third Roma Workshop Proofs and Linguistic Categories","author":"F. Lamarche","year":"1996","unstructured":"Lamarche, F., Retor\u00e9, C.: Proof nets for the Lambek-calculus \u2014 an overview. In: Abrusci, V.M., Casadio, C. (eds.) Proceedings of the Third Roma Workshop Proofs and Linguistic Categories, pp. 241\u2013262. CLUEB, Bologna (1996)"},{"issue":"4:3","key":"14_CR10","first-page":"1","volume":"2","author":"F. Lamarche","year":"2006","unstructured":"Lamarche, F., Stra\u00dfburger, L.: From proof nets to the free *-autonomous category. Logical Methods in Computer Science\u00a02(4:3), 1\u201344 (2006)","journal-title":"Logical Methods in Computer Science"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/s00012-008-2062-4","volume":"58","author":"T. Litak","year":"2008","unstructured":"Litak, T., Kowalski, T.: Completions of GBL algebras: negative results. Algebra Universalis\u00a058, 373\u2013384 (2008)","journal-title":"Algebra Universalis"},{"key":"14_CR12","unstructured":"Metcalfe, G.: A sequent calculus for constructive logic with strong negation as a substructural logic. To appear in Bulletin of the Section of Logic"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1093\/logcom\/exl001","volume":"16","author":"G. Metcalfe","year":"2006","unstructured":"Metcalfe, G.: Proof theory for Casari\u2019s comparative logics. J. Log. Comput.\u00a016(4), 405\u2013422 (2006)","journal-title":"J. Log. Comput."},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/1071596.1071600","volume":"6","author":"G. Metcalfe","year":"2005","unstructured":"Metcalfe, G., Olivetti, N., Gabbay, D.M.: Sequent and hypersequent calculi for Abelian and \u0141ukasiewicz logics. ACM Trans. Comput. Log.\u00a06(3), 578\u2013613 (2005)","journal-title":"ACM Trans. Comput. Log."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Meyer, R., Slaney, J.: Abelien logic (from A to Z). In: Paraconsistent Logic: Essays on the Inconsistent, pp. 245\u2013288 (1989)","DOI":"10.2307\/j.ctv2x8v8c7.12"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Meyer, R., Slaney, J.: Still adorable, Paraconsistency: The Logical Way to the Inconsistent. In: Proceedings of the world congress on paraconsistency held in Sao Paulo, pp. 241\u2013260 (2002)","DOI":"10.1201\/9780203910139.pt2"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1016\/0304-3975(96)00045-X","volume":"165","author":"D. Miller","year":"1996","unstructured":"Miller, D.: Forum: A multiple-conclusion specification logic. Theoretical Computer Science\u00a0165, 201\u2013232 (1996)","journal-title":"Theoretical Computer Science"},{"key":"14_CR18","volume-title":"Residuated Lattices: an algebraic glimpse at substructural logics","author":"T. Kowalski","year":"2007","unstructured":"Kowalski, T., Galatos, N., Jipsen, P., Ono, H.: Residuated Lattices: an algebraic glimpse at substructural logics. Elsevier, Amsterdam (2007)"},{"issue":"5-6","key":"14_CR19","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10992-005-2267-3","volume":"34","author":"S. Negri","year":"2005","unstructured":"Negri, S.: Proof analysis in modal logics. Journal of Philosophical Logic\u00a034(5-6), 507\u2013544 (2005)","journal-title":"Journal of Philosophical Logic"},{"issue":"3","key":"14_CR20","doi-asserted-by":"publisher","first-page":"979","DOI":"10.2307\/2586685","volume":"65","author":"G. Sambin","year":"2000","unstructured":"Sambin, G., Battilotti, G., Faggian, C.: Basic logic: Reflection, symmetry, visibility. J. Symb. Log.\u00a065(3), 979\u20131013 (2000)","journal-title":"J. Symb. Log."},{"issue":"4","key":"14_CR21","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1093\/logcom\/1.4.537","volume":"1","author":"H. Schellinx","year":"1991","unstructured":"Schellinx, H.: Some syntactical observations on linear logic. Journal of Logic and Computation\u00a01(4), 537\u2013559 (1991)","journal-title":"Journal of Logic and Computation"},{"key":"14_CR22","unstructured":"Shirahata, M.: A sequent calculus for compact closed categories. Unpublished (2000)"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"663","DOI":"10.1080\/00927877508822067","volume":"3","author":"M.E. Szabo","year":"1975","unstructured":"Szabo, M.E.: Polycategories. Comm. Alg.\u00a03, 663\u2013689 (1975)","journal-title":"Comm. Alg."},{"issue":"3","key":"14_CR24","doi-asserted-by":"publisher","first-page":"738","DOI":"10.2178\/jsl\/1191333839","volume":"72","author":"K. Terui","year":"2007","unstructured":"Terui, K.: Which structural rules admit cut elimination? An algebraic criterion. Journal of Symbolic Logic\u00a072(3), 738\u2013754 (2007)","journal-title":"Journal of Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04027-6_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,26]],"date-time":"2023-05-26T19:07:56Z","timestamp":1685128076000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04027-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642040269","9783642040276"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04027-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}