乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,6]],"date-time":"2024-10-06T00:47:10Z","timestamp":1728175630072},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319243115"},{"type":"electronic","value":"9783319243122"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-24312-2_10","type":"book-chapter","created":{"date-parts":[[2015,9,10]],"date-time":"2015-09-10T14:06:46Z","timestamp":1441894006000},"page":"135-150","source":"Crossref","is-referenced-by-count":18,"title":["Linear Nested Sequents, 2-Sequents and Hypersequents"],"prefix":"10.1007","author":[{"given":"Bj\u00f6rn","family":"Lellmann","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,11,8]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","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, Clarendon (1996)","DOI":"10.1093\/oso\/9780198538622.003.0001"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Blackburn, P., de Rijke, M., Venema, Y.: Modal Logic. Cambridge University Press (2001)","DOI":"10.1017\/CBO9781107050884"},{"key":"10_CR3","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. Log.\u00a048, 551\u2013577 (2009)","journal-title":"Arch. Math. Log."},{"issue":"4","key":"10_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/s005000050047","volume":"2","author":"A. Ciabattoni","year":"1999","unstructured":"Ciabattoni, A., Gabbay, D.M., Olivetti, N.: Cut-free proof systems for logics of weak excluded middle. Soft Computing\u00a02(4), 147\u2013156 (1999)","journal-title":"Soft Computing"},{"key":"10_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"160","DOI":"10.1007\/10722086_15","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"A. Ciabattoni","year":"2000","unstructured":"Ciabattoni, A., Ferrari, M.: Hypertableau and path-hypertableau calculi for some families of intermediate logics. In: Dyckhoff, R. (ed.) TABLEAUX 2000. LNCS, vol.\u00a01847, pp. 160\u2013174. Springer, Heidelberg (2000)"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.apal.2011.09.004","volume":"163","author":"M. Fitting","year":"2012","unstructured":"Fitting, M.: Prefixed tableaus and nested sequents. Ann. Pure Appl. Logic\u00a0163(3), 291\u2013313 (2012)","journal-title":"Ann. Pure Appl. Logic"},{"issue":"1","key":"10_CR7","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1215\/00294527-2377869","volume":"55","author":"M. Fitting","year":"2014","unstructured":"Fitting, M.: Nested sequents for intuitionistic logics. Notre Dame Journal of Formal Logic\u00a055(1), 41\u201361 (2014)","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"10_CR8","unstructured":"Gor\u00e9, R., Ramanayake, R.: Labelled tree sequents, tree hypersequents and nested (deep) sequents. In: Bolander, T., Bra\u00fcner, T., Ghilardi, S., Moss, L.S. (eds.) AiML 9, pp. 279\u2013299. College Publications (2012)"},{"key":"10_CR9","volume-title":"Introduction to Metamathematics","author":"S.C. Kleene","year":"1952","unstructured":"Kleene, S.C.: Introduction to Metamathematics. North-Holland, Amsterdam (1952)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"318","DOI":"10.1007\/978-3-540-72734-7_23","volume-title":"Logical Foundations of Computer Science","author":"H. Kurokawa","year":"2007","unstructured":"Kurokawa, H.: Hypersequent calculus for intuitionistic logic with classical atoms. In: Artemov, S., Nerode, A. (eds.) LFCS 2007. LNCS, vol.\u00a04514, pp. 318\u2013331. Springer, Heidelberg (2007)"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"Lahav, O.: From frame properties to hypersequent rules in modal logics. In: LICS 2013 (2013)","DOI":"10.1109\/LICS.2013.47"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/978-3-319-08587-6_23","volume-title":"Automated Reasoning","author":"B. Lellmann","year":"2014","unstructured":"Lellmann, B.: Axioms vs hypersequent rules with context restrictions: Theory and applications. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS, vol.\u00a08562, pp. 307\u2013321. Springer, Heidelberg (2014)"},{"key":"10_CR13","unstructured":"Marin, S., Stra\u00dfburger, L.: Label-free modular systems for classical and intuitionistic modal logics. In: Gor\u00e9, R., Kooi, B.P., Kurucz, A. (eds.) AiML 10, pp. 387\u2013406. College Publications (2014)"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Martini, S., Masini, A.: A computational interpretation of modal proofs. In: Wansing, H. (ed.) Proof Theory of Modal Logic, pp. 213\u2013241. Kluwer (1996)","DOI":"10.1007\/978-94-017-2798-3_12"},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/0168-0072(92)90029-Y","volume":"58","author":"A. Masini","year":"1992","unstructured":"Masini, A.: 2-sequent calculus: a proof theory of modalities. Ann. Pure Aplied Logic\u00a058, 229\u2013246 (1992)","journal-title":"Ann. Pure Aplied Logic"},{"issue":"5","key":"10_CR16","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1093\/logcom\/3.5.533","volume":"3","author":"A. Masini","year":"1993","unstructured":"Masini, A.: 2-sequent calculus: Intuitionism and natural deduction. J. Log. Comput.\u00a03(5), 533\u2013562 (1993)","journal-title":"J. Log. Comput."},{"key":"10_CR17","first-page":"422","volume-title":"Modal Logic","author":"G. Mints","year":"1974","unstructured":"Mints, G.: Sistemy lyuisa i sistema T (Supplement to the Russian translation). In: Feys, R. (ed.) Modal Logic, pp. 422\u2013509. Nauka, Moscow (1974)"},{"key":"10_CR18","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 logic. J. Philos. Logic\u00a034, 507\u2013544 (2005)","journal-title":"J. Philos. Logic"},{"issue":"1","key":"10_CR19","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1017\/S1755020308080040","volume":"1","author":"F. Poggiolesi","year":"2008","unstructured":"Poggiolesi, F.: A cut-free simple sequent calculus for modal logic S5. Rev. Symb. Log.\u00a01(1), 3\u201315 (2008)","journal-title":"Rev. Symb. Log."},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Poggiolesi, F.: The method of tree-hypersequents for modal propositional logic. In: Makinson, D., Malinkowski, J., Wansing, H. (eds.) Towards Mathematical Philosophy. Trends in Logic, vol.\u00a028, pp. 31\u201351. Springer (2009)","DOI":"10.1007\/978-1-4020-9084-4_3"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"Poggiolesi, F.: Gentzen Calculi for Modal Propositional Logic. Trends in Logic, vol.\u00a032. Springer (2010)","DOI":"10.1007\/978-90-481-9670-8"},{"issue":"3","key":"10_CR22","first-page":"900","volume":"48","author":"G. Pottinger","year":"1983","unstructured":"Pottinger, G.: Uniform, cut-free formulations of T, S4 and S5 (abstract). J. Symb. Logic\u00a048(3), 900 (1983)","journal-title":"J. Symb. Logic"},{"key":"10_CR23","doi-asserted-by":"crossref","unstructured":"Ramanayake, R.: Non-commutative classical arithmetical sequent calculi are intuitionistic (2015), accepted for publication in the Special issue of the Logic Journal of the IGPL: ISRALOG\u201914 post-proceedings","DOI":"10.1093\/jigpal\/jzw007"},{"key":"10_CR24","doi-asserted-by":"crossref","unstructured":"Restall, G.: Proofnets for S5: sequents and circuits for modal logic. In: Dimitracopoulos, C., Newelski, L., Normann, D. (eds.) Logic Colloquium 2005. Lecture Notes in Logic, vol.\u00a028, pp. 151\u2013172. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511546464.012"},{"key":"10_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/978-3-642-04027-6_34","volume-title":"Computer Science Logic","author":"M. Tatsuta","year":"2009","unstructured":"Tatsuta, M.: Non-commutative first-order sequent calculus. In: Gr\u00e4del, E., Kahle, R. (eds.) CSL 2009. LNCS, vol.\u00a05771, pp. 470\u2013484. Springer, Heidelberg (2009)"},{"key":"10_CR26","doi-asserted-by":"crossref","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science, vol.\u00a043. Cambridge University Press (2000)","DOI":"10.1017\/CBO9781139168717"},{"key":"10_CR27","doi-asserted-by":"crossref","unstructured":"Wansing, H.: Sequent systems for modal logics. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol, vol.\u00a08, Springer (2002)","DOI":"10.1007\/978-94-010-0387-2_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-319-24312-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T01:29:24Z","timestamp":1718069364000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24312-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319243115","9783319243122"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24312-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}