{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T17:09:54Z","timestamp":1760202594999},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027154"},{"type":"electronic","value":"9783642027161"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02716-1_21","type":"book-chapter","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T04:22:21Z","timestamp":1246335741000},"page":"280-294","source":"Crossref","is-referenced-by-count":4,"title":["Generic Modal Cut Elimination Applied to Conditional Logics"],"prefix":"10.1007","author":[{"given":"Dirk","family":"Pattinson","sequence":"first","affiliation":[]},{"given":"Lutz","family":"Schr\u00f6der","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/3-540-45744-5_45","volume-title":"Automated Reasoning","author":"A. Avron","year":"2001","unstructured":"Avron, A., Lev, I.: Canonical propositional gentzen-type systems. In: Gor\u00e9, R.P., Leitsch, A., Nipkow, T. (eds.) IJCAR 2001. LNCS, vol.\u00a02083, pp. 529\u2013544. Springer, Heidelberg (2001)"},{"key":"21_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511621192","volume-title":"Modal Logic","author":"B. Chellas","year":"1980","unstructured":"Chellas, B.: Modal Logic. Cambridge University Press, Cambridge (1980)"},{"key":"21_CR3","first-page":"229","volume-title":"Logic in Computer Science, LICS 2008","author":"A. Ciabattoni","year":"2008","unstructured":"Ciabattoni, A., Galatos, N., Terui, K.: From axioms to analytic rules in nonclassical logics. In: Logic in Computer Science, LICS 2008, pp. 229\u2013240. IEEE Press, Los Alamitos (2008)"},{"key":"21_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/s11225-006-6607-2","volume":"82","author":"A. Ciabattoni","year":"2006","unstructured":"Ciabattoni, A., Terui, K.: Towards a semantic characterization of cut-elimination. Stud. Log.\u00a082, 95\u2013119 (2006)","journal-title":"Stud. Log."},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"176","DOI":"10.1007\/BF01201353","volume":"39","author":"G. Gentzen","year":"1934","unstructured":"Gentzen, G.: Untersuchungen \u00fcber das logische Schlie\u00dfen. Math. Z.\u00a039, 176\u2013210 (1934)","journal-title":"Math. Z."},{"key":"21_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"210","DOI":"10.1007\/3-540-61208-4_14","volume-title":"Theorem Proving with Analytic Tableaux and Related Methods","author":"A. Heuerding","year":"1996","unstructured":"Heuerding, A., Seyfried, M., Zimmermann, H.: Efficient loop-check for backward proof search in some non-classical propositional logics. In: Miglioli, P., Moscato, U., Ornaghi, M., Mundici, D. (eds.) TABLEAUX 1996. LNCS, vol.\u00a01071, pp. 210\u2013225. Springer, Heidelberg (1996)"},{"key":"21_CR7","doi-asserted-by":"crossref","unstructured":"Ladner, R.E.: The computational complexity of provability in systems of modal propositional logic. SIAM J. Comput.\u00a06 (1977)","DOI":"10.1137\/0206033"},{"key":"21_CR8","doi-asserted-by":"crossref","unstructured":"Olivetti, N., Pozzato, G.L., Schwind, C.: A sequent calculus and a theorem prover for standard conditional logics. ACM Trans. Comput. Logic\u00a08(4) (2007)","DOI":"10.1145\/1276920.1276924"},{"key":"21_CR9","series-title":"ENTCS","first-page":"221","volume-title":"Coalgebraic Methods in Computer Science, CMCS 2008","author":"D. Pattinson","year":"2008","unstructured":"Pattinson, D., Schr\u00f6der, L.: Admissibility of cut in coalgebraic logics. In: Coalgebraic Methods in Computer Science, CMCS 2008. ENTCS, vol.\u00a0203, pp. 221\u2013241. Elsevier, Amsterdam (2008)"},{"key":"21_CR10","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.apal.2007.08.001","volume":"149","author":"J. Rasga","year":"2007","unstructured":"Rasga, J.: Sufficient conditions for cut elimination with complexity analysis. Ann. Pure Appl. Logic\u00a0149, 81\u201399 (2007)","journal-title":"Ann. Pure Appl. Logic"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Schr\u00f6der, L., Pattinson, D.: Shallow models for non-iterative modal logics. In: Dengel, A.R., Berns, K., Breuel, T.M., Bomarius, F., Roth-Berghofer, T.R. (eds.) KI 2008. LNCS(LNAI), vol.\u00a05243, pp. 324\u2013331. Springer, Heidelberg (2008)","DOI":"10.1007\/978-3-540-85845-4_40"},{"issue":"2:13","key":"21_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1462179.1462185","volume":"10","author":"L. Schr\u00f6der","year":"2009","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE bounds for rank-1 modal logics. ACM Trans. Comput. Log.\u00a010(2:13), 1\u201333 (2009)","journal-title":"ACM Trans. Comput. Log."},{"key":"21_CR13","first-page":"243","volume-title":"Logic in Computer Science, LICS 1989","author":"M. Vardi","year":"1989","unstructured":"Vardi, M.: On the complexity of epistemic reasoning. In: Logic in Computer Science, LICS 1989, pp. 243\u2013251. IEEE, Los Alamitos (1989)"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02716-1_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T10:55:54Z","timestamp":1619780154000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02716-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027154","9783642027161"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02716-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}