{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T18:13:59Z","timestamp":1725732839779},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387081"},{"type":"electronic","value":"9783642387098"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-44602-7_20","type":"book-chapter","created":{"date-parts":[[2014,8,23]],"date-time":"2014-08-23T01:18:40Z","timestamp":1408756720000},"page":"250-264","source":"Crossref","is-referenced-by-count":4,"title":["From Display Calculi to Deep Nested Sequent Calculi: Formalised for Full Intuitionistic Linear Logic"],"prefix":"10.1007","author":[{"given":"Jeremy E.","family":"Dawson","sequence":"first","affiliation":[]},{"given":"Ranald","family":"Clouston","sequence":"additional","affiliation":[]},{"given":"Rajeev","family":"Gor\u00e9","sequence":"additional","affiliation":[]},{"given":"Alwen","family":"Tiu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1007\/BF00302340","volume":"11","author":"N.D. Belnap","year":"1982","unstructured":"Belnap, N.D.: Display logic. J. Philos. Logic\u00a011, 375\u2013417 (1982)","journal-title":"J. Philos. Logic"},{"issue":"3","key":"20_CR2","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/0168-0072(96)00004-8","volume":"79","author":"G.M. Bierman","year":"1996","unstructured":"Bierman, G.M.: A note on full intuitionistic linear logic. Ann. Pure Appl. Logic\u00a079(3), 281\u2013287 (1996)","journal-title":"Ann. Pure Appl. Logic"},{"key":"20_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/BFb0028011","volume-title":"Computer Science Logic","author":"T. Br\u00e4uner","year":"1998","unstructured":"Br\u00e4uner, T., de Paiva, V.: A formulation of linear logic based on dependency-relations. In: Nielsen, M. (ed.) CSL 1997. LNCS, vol.\u00a01414, pp. 129\u2013148. Springer, Heidelberg (1998)"},{"issue":"6","key":"20_CR4","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/s00153-009-0137-3","volume":"48","author":"K. Br\u00fcnnler","year":"2009","unstructured":"Br\u00fcnnler, K.: Deep sequent systems for modal logic. Arch. Math. Logic\u00a048(6), 551\u2013577 (2009)","journal-title":"Arch. Math. Logic"},{"key":"20_CR5","unstructured":"Clouston, R., Dawson, J.E., Gor\u00e9, R., Tiu, A.: Annotation-free sequent calculi for full intuitionistic linear logic. In: CSL, pp. 197\u2013214 (2013)"},{"key":"20_CR6","unstructured":"Clouston, R., Dawson, J.E., Gor\u00e9, R., Tiu, A.: Annotation-free sequent calculi for full intuitionistic linear logic - extended version. CoRR, abs\/1307.0289 (2013)"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/3-540-45685-6_10","volume-title":"Theorem Proving in Higher Order Logics","author":"J.E. Dawson","year":"2002","unstructured":"Dawson, J.E., Gor\u00e9, R.P.: Formalised cut admissibility for display logic. In: Carre\u00f1o, V.A., Mu\u00f1oz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol.\u00a02410, pp. 131\u2013147. Springer, Heidelberg (2002)"},{"key":"20_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-16242-8_19","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J.E. Dawson","year":"2010","unstructured":"Dawson, J.E., Gor\u00e9, R.: Generic methods for formalising sequent calculi applied to provability logic. In: Ferm\u00fcller, C.G., Voronkov, A. (eds.) LPAR-17. LNCS, vol.\u00a06397, pp. 263\u2013277. Springer, Heidelberg (2010)"},{"issue":"3","key":"20_CR9","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1093\/jigpal\/6.3.451","volume":"6","author":"R. Gor\u00e9","year":"1998","unstructured":"Gor\u00e9, R.: Substructural logics on display. Log. J. IGPL\u00a06(3), 451\u2013504 (1998)","journal-title":"Log. J. IGPL"},{"key":"20_CR10","unstructured":"Gor\u00e9, R., Postniece, L., Tiu, A.: Cut-elimination and proof search for bi-intuitionistic tense logic. In: AiML, pp. 156\u2013177 (2010)"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Gor\u00e9, R., Postniece, L., Tiu, A.: On the correspondence between display postulates and deep inference in nested sequent calculi for tense logics. LMCS\u00a07(2) (2011)","DOI":"10.2168\/LMCS-7(2:8)2011"},{"issue":"3","key":"20_CR12","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/0168-0072(93)90146-5","volume":"64","author":"M. Hyland","year":"1993","unstructured":"Hyland, M., de Paiva, V.: Full intuitionistic linear logic (extended abstract). Ann. Pure Appl. Logic\u00a064(3), 273\u2013291 (1993)","journal-title":"Ann. Pure Appl. Logic"},{"key":"20_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/BF01053026","volume":"53","author":"R. Kashima","year":"1994","unstructured":"Kashima, R.: Cut-free sequent calculi for some tense logics. Studia Log.\u00a053, 119\u2013135 (1994)","journal-title":"Studia Log."},{"key":"20_CR14","doi-asserted-by":"crossref","unstructured":"Park, J., Seo, J., Park, S.: A theorem prover for boolean BI. In: POPL 2013, pp. 219\u2013232 (2013)","DOI":"10.1145\/2429069.2429095"},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Poggiolesi, F.: The method of tree-hypersequents for modal propositional logic. In: Trends in Logic IV, pp. 31\u201351 (2009)","DOI":"10.1007\/978-1-4020-9084-4_3"},{"issue":"4","key":"20_CR16","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. J. Logic Comput.\u00a01(4), 537\u2013559 (1991)","journal-title":"J. Logic Comput."},{"key":"20_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-642-37075-5_14","volume-title":"Foundations of Software Science and Computation Structures","author":"L. Stra\u00dfburger","year":"2013","unstructured":"Stra\u00dfburger, L.: Cut elimination in nested sequents for intuitionistic modal logics. In: Pfenning, F. (ed.) FOSSACS 2013 (ETAPS 2013). LNCS, vol.\u00a07794, pp. 209\u2013224. Springer, Heidelberg (2013)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Traytel, D., Popescu, A., Blanchette, J.C.: Foundational, compositional (co)datatypes for higher-order logic: Category theory applied to theorem proving. In: LICS, pp. 596\u2013605 (2012)","DOI":"10.1109\/LICS.2012.75"},{"issue":"4","key":"20_CR19","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10817-008-9097-2","volume":"40","author":"C. Urban","year":"2008","unstructured":"Urban, C.: Nominal techniques in isabelle\/HOL. J. Automat. Reason.\u00a040(4), 327\u2013356 (2008)","journal-title":"J. Automat. Reason."}],"container-title":["Lecture Notes in Computer Science","Advanced Information Systems Engineering"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-44602-7_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T06:36:53Z","timestamp":1565764613000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-44602-7_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642387081","9783642387098"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-44602-7_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}