{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:25:36Z","timestamp":1725585936331},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642221187"},{"type":"electronic","value":"9783642221194"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22119-4_17","type":"book-chapter","created":{"date-parts":[[2011,6,15]],"date-time":"2011-06-15T10:21:08Z","timestamp":1308133268000},"page":"211-225","source":"Crossref","is-referenced-by-count":6,"title":["Cut Elimination for Shallow Modal Logics"],"prefix":"10.1007","author":[{"given":"Bj\u00f6rn","family":"Lellmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dirk","family":"Pattinson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"17_CR1","series-title":"LNCS","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)"},{"issue":"1","key":"17_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1017\/S0960129507006573","volume":"18","author":"A. Ciabattoni","year":"2008","unstructured":"Ciabattoni, A., Leitsch, A.: Towards an algorithmic construction of cut-elimination procedures. Math. Struct. in Comp. Sci.\u00a018(1), 81\u2013105 (2008)","journal-title":"Math. Struct. in Comp. Sci."},{"key":"17_CR3","first-page":"244","volume":"52","author":"J. Esparza","year":"1994","unstructured":"Esparza, J., Nielsen, M.: Decidability issues for petri nets - a survey. Bulletin of the EATCS\u00a052, 244\u2013262 (1994)","journal-title":"Bulletin of the EATCS"},{"key":"17_CR4","doi-asserted-by":"crossref","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)","DOI":"10.1007\/3-540-61208-4_14"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Lewis II, P.M., Stearns, R.E., Hartmanis, J.: Memory bounds for recognition of context-free and context-sensitive languages. In: FOCS, pp. 191\u2013202 (1965)","DOI":"10.1109\/FOCS.1965.14"},{"issue":"3","key":"17_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF01049412","volume":"4","author":"\u00c1. Kurucz","year":"1995","unstructured":"Kurucz, \u00c1., N\u00e9meti, I., Sain, I., Simon, A.: Decidable and undecidable logics with a binary modality. J. of Log., Lang. and Inf.\u00a04(3), 191\u2013206 (1995)","journal-title":"J. of Log., Lang. and Inf."},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-94-017-0456-4_1","volume-title":"Handbook of Philosophical Logic","author":"D. Nute","year":"2001","unstructured":"Nute, D., Cross, C.B.: Conditional logic. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol.\u00a04, pp. 1\u201398. Kluwer, Dordrecht (2001)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Olivetti, N., Pozzato, G.L., Schwind, C.B.: A sequent calculus and a theorem prover for standard conditional logics. ACM Trans. Comput. Logic\u00a08(4), 22\/1\u201322\/51 (2007)","DOI":"10.1145\/1276920.1276924"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Olivetti, N., Schwind, C.B.: A calculus and complexity bound for minimal conditional logic. In: ICTCS, pp. 384\u2013404 (2001)","DOI":"10.1007\/3-540-45446-2_25"},{"key":"17_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/978-3-540-78499-9_6","volume-title":"Foundations of Software Science and Computational Structures","author":"D. Pattinson","year":"2008","unstructured":"Pattinson, D., Schr\u00f6der, L.: Beyond rank 1: Algebraic semantics and finite models for coalgebraic logics. In: Amadio, R. (ed.) FOSSACS 2008. LNCS, vol.\u00a04962, pp. 66\u201380. Springer, Heidelberg (2008)"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Pattinson, D., Schr\u00f6der, L.: Generic modal cut elimination applied to conditional logics. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS, vol.\u00a05607, pp. 280\u2013294. Springer, Heidelberg (2009)","DOI":"10.1007\/978-3-642-02716-1_21"},{"key":"17_CR12","doi-asserted-by":"crossref","unstructured":"Rasga, J.: Sufficient conditions for cut elimination with complexity analysis. Ann. Pure Appl.Logic\u00a0149, 81\u201399 (2007)","DOI":"10.1016\/j.apal.2007.08.001"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Schr\u00f6der, L., Pattinson, D.: PSPACE bounds for rank-1 modal logics. ACM Trans. Comput. Logic (TOCL)\u00a010(2), 13:1\u201313:33 (2009)","DOI":"10.1145\/1462179.1462185"},{"key":"17_CR14","series-title":"Cambridge Tracts In Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168717","volume-title":"Basic Proof Theory","author":"A.S. Troelstra","year":"2000","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory, 2nd edn. Cambridge Tracts In Theoretical Computer Science, vol.\u00a043. Cambridge University Press, Cambridge (2000)","edition":"2"}],"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-22119-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T15:44:39Z","timestamp":1560267879000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22119-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642221187","9783642221194"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22119-4_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}