{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T13:46:55Z","timestamp":1751982415918},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642162411"},{"type":"electronic","value":"9783642162428"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16242-8_13","type":"book-chapter","created":{"date-parts":[[2010,10,4]],"date-time":"2010-10-04T12:51:59Z","timestamp":1286196719000},"page":"172-186","source":"Crossref","is-referenced-by-count":4,"title":["How to Universally Close the Existential Rule"],"prefix":"10.1007","author":[{"given":"Kai","family":"Br\u00fcnnler","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","first-page":"1","volume-title":"Logic: from foundations to applications. Proc. Logic Colloquium","author":"A. Avron","year":"1996","unstructured":"Avron, A.: The method of hypersequents in the proof theory of propositional non-classical logics. In: Hodges, W., Hyland, M., Steinhorn, C., Truss, J. (eds.) Logic: from foundations to applications. Proc. Logic Colloquium, Keele, UK, 1993, pp. 1\u201332. Oxford University Press, New York (1996)"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/logcom\/13.6.835","volume":"13","author":"M. Baaz","year":"2003","unstructured":"Baaz, M., Ciabattoni, A., Ferm\u00fcller, C.G.: Hypersequent calculi for G\u00f6del logics: a survey. Journal of Logic and Computation\u00a013, 1\u201327 (2003)","journal-title":"Journal of Logic and Computation"},{"key":"13_CR3","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/BF00284976","volume":"11","author":"N.D. Belnap Jr.","year":"1982","unstructured":"Belnap Jr., N.D.: Display logic. Journal of Philosophical Logic\u00a011, 375\u2013417 (1982)","journal-title":"Journal of Philosophical Logic"},{"key":"13_CR4","first-page":"373","volume-title":"Handbook of Philosophical Logic: Volume III: Alternatives to Classical Logic","author":"E. Bencivenga","year":"1986","unstructured":"Bencivenga, E.: Free logics. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic: Volume III: Alternatives to Classical Logic, pp. 373\u2013426. Reidel, Dordrecht (1986)"},{"issue":"6","key":"13_CR5","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. Archive for Mathematical Logic\u00a048(6), 551\u2013577 (2009), http:\/\/www.iam.unibe.ch\/~kai\/Papers\/2009dssml.pdf","journal-title":"Archive for Mathematical Logic"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-642-02716-1_12","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"K. Br\u00fcnnler","year":"2009","unstructured":"Br\u00fcnnler, K., Stra\u00dfburger, L.: Modular sequent systems for modal logic. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS, vol.\u00a05607, pp. 152\u2013166. Springer, Heidelberg (2009)"},{"key":"13_CR7","unstructured":"Michael Dunn, J.: A \u2018Gentzen\u2019 system for positive relevant implication. The Journal of Symbolic Logic\u00a038, 356\u2013357 (1974) (Abstract)"},{"key":"13_CR8","series-title":"Synthese library","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-011-5292-1","volume-title":"First-order Modal Logic","author":"M. Fitting","year":"1998","unstructured":"Fitting, M., Mendelsohn, R.L.: First-order Modal Logic. Synthese library, vol.\u00a0277. Kluwer, Dordrecht (1998)"},{"key":"13_CR9","first-page":"68","volume-title":"The Collected Papers of Gerhard Gentzen","author":"G. Gentzen","year":"1969","unstructured":"Gentzen, G.: Investigations into logical deduction. In: Szabo, M.E. (ed.) The Collected Papers of Gerhard Gentzen, pp. 68\u2013131. North-Holland Publishing Co., Amsterdam (1969)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-642-02716-1_15","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"R. Gor\u00e9","year":"2009","unstructured":"Gor\u00e9, R., Postniece, L., Tiu, A.: Taming displayed tense logics using nested sequents with deep inference. In: Giese, M., Waaler, A. (eds.) TABLEAUX 2009. LNCS, vol.\u00a05607, pp. 189\u2013204. Springer, Heidelberg (2009)"},{"key":"13_CR11","unstructured":"Guglielmi, A.: Mismatch (2003), http:\/\/cs.bath.ac.uk\/ag\/p\/AG9.pdf"},{"issue":"1","key":"13_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1182613.1182614","volume":"8","author":"A. Guglielmi","year":"2007","unstructured":"Guglielmi, A.: A system of interaction and structure. ACM Transactions on Computational Logic\u00a08(1), 1\u201364 (2007)","journal-title":"ACM Transactions on Computational Logic"},{"key":"13_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 Logica\u00a053, 119\u2013135 (1994)","journal-title":"Studia Logica"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/BF01084083","volume":"6","author":"G. Mints","year":"1976","unstructured":"Mints, G.: Cut-elimination theorem in relevant logics. The Journal of Soviet Mathematics\u00a06, 422\u2013428 (1976)","journal-title":"The Journal of Soviet Mathematics"},{"key":"13_CR15","series-title":"Trends in Logic","first-page":"9","volume-title":"Towards Mathematical Philosophy","author":"F. Poggiolesi","year":"2009","unstructured":"Poggiolesi, F.: The tree-hypersequent method for modal propositional logic. In: Malinowski, J., Makinson, D., Wansing, H. (eds.) Towards Mathematical Philosophy. Trends in Logic, pp. 9\u201330. Springer, Heidelberg (2009)"},{"key":"13_CR16","doi-asserted-by":"crossref","unstructured":"Sadrzadeh, M., Dyckhoff, R.: Positive logic with adjoint modalities: Proof theory, semantics and reasoning about information. Review of Symbolic Logic (to appear, 2010)","DOI":"10.1017\/S1755020310000134"},{"key":"13_CR17","volume-title":"Basic Proof Theory","author":"A.S. Troelstra","year":"1996","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press, Cambridge (1996)"},{"key":"13_CR18","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3208-5","volume-title":"Labelled Non-Classical Logics","author":"L. Vigan\u00f2","year":"2000","unstructured":"Vigan\u00f2, L.: Labelled Non-Classical Logics. Kluwer Academic Publishers, Dordrecht (2000)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16242-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T10:18:02Z","timestamp":1591957082000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16242-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642162411","9783642162428"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16242-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}