{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:36:13Z","timestamp":1742913373287,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319115573"},{"type":"electronic","value":"9783319115580"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-11558-0_2","type":"book-chapter","created":{"date-parts":[[2014,9,16]],"date-time":"2014-09-16T02:22:39Z","timestamp":1410834159000},"page":"18-32","source":"Crossref","is-referenced-by-count":4,"title":["Tools for the Investigation of Substructural and Paraconsistent Logics"],"prefix":"10.1007","author":[{"given":"Agata","family":"Ciabattoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lara","family":"Spendier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"2_CR1","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1093\/logcom\/2.3.297","volume":"2","author":"J.-M. Andreoli","year":"1992","unstructured":"Andreoli, J.-M.: Logic programming with focusing proofs in linear logic. Journal of Logic and Computation\u00a02(3), 297\u2013347 (1992)","journal-title":"Journal of Logic and Computation"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01531058","volume":"4","author":"A. Avron","year":"1991","unstructured":"Avron, A.: Hypersequents, logical consequence and intermediate logics for concurrency. Annals of Mathematics and Artificial Intelligence\u00a04, 225\u2013248 (1991)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1093\/logcom\/exs039","volume":"21","author":"A. Avron","year":"2013","unstructured":"Avron, A., Konikowska, B., Zamansky, A.: Cut-free sequent calculi for C-systems with generalized finite-valued semantics. Journal of Logic and Computation\u00a021(3), 517\u2013540 (2013)","journal-title":"Journal of Logic and Computation"},{"issue":"3","key":"2_CR4","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1093\/logcom\/exi001","volume":"15","author":"A. Avron","year":"2005","unstructured":"Avron, A., Lev, I.: Non-deterministic multiple-valued structures. Journal of Logic and Computation\u00a015(3), 241\u2013261 (2005)","journal-title":"Journal of Logic and Computation"},{"key":"2_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1007\/3-540-61511-3_84","volume-title":"Automated Deduction - Cade-13","author":"M. Baaz","year":"1996","unstructured":"Baaz, M., Ferm\u00fcller, C.G., Salzer, G., Zach, R.: MUltlog 1.0: Towards an expert system for many-valued logics. In: McRobbie, M.A., Slaney, J.K. (eds.) CADE 1996. LNCS, vol.\u00a01104, pp. 226\u2013230. Springer, Heidelberg (1996)"},{"issue":"4","key":"2_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10817-013-9273-x","volume":"51","author":"M. Baaz","year":"2013","unstructured":"Baaz, M., Lahav, O., Zamansky, A.: Finite-valued semantics for canonical labelled calculi. Journal of Automated Reasoning\u00a051(4), 401\u2013430 (2013)","journal-title":"Journal of Automated Reasoning"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/978-3-642-32621-9_12","volume-title":"Logic, Language, Information and Computation","author":"P. Baldi","year":"2012","unstructured":"Baldi, P., Ciabattoni, A., Spendier, L.: Standard completeness for extensions of MTL: An automated approach. In: Ong, L., de Queiroz, R. (eds.) WoLLIC 2012. LNCS, vol.\u00a07456, pp. 154\u2013167. Springer, Heidelberg (2012)"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Carnielli, W.A., Marcos, J.: A taxonomy of C-systems. In: Carnielli, W.A., Coniglio, M.E., Ottaviano, I.D. (eds.) Paraconsistency: The Logical Way to the Inconsistent, pp. 1\u201394 (2002)","DOI":"10.1201\/9780203910139.pt1"},{"key":"2_CR9","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537793.001.0001","volume-title":"Modal Logic","author":"A. Chagrov","year":"1997","unstructured":"Chagrov, A., Zakharyaschev, M.: Modal Logic. Clarendon Press, Oxford (1997)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"Ciabattoni, A., Galatos, N., Terui, K.: From axioms to analytic rules in nonclassical logics. In: Proceedings of LICS 2008, pp. 229\u2013240 (2008)","DOI":"10.1109\/LICS.2008.39"},{"issue":"4","key":"2_CR11","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1007\/s00012-011-0160-1","volume":"66","author":"A. Ciabattoni","year":"2011","unstructured":"Ciabattoni, A., Galatos, N., Terui, K.: MacNeille Completions of FL-algebras. Algebra Universalis\u00a066(4), 405\u2013420 (2011)","journal-title":"Algebra Universalis"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1016\/j.apal.2011.09.003","volume":"163","author":"A. Ciabattoni","year":"2012","unstructured":"Ciabattoni, A., Galatos, N., Terui, K.: Algebraic proof theory for substructural logics: cut-elimination and completions. Annals of Pure and Applied Logic\u00a0163(3), 266\u2013290 (2012)","journal-title":"Annals of Pure and Applied Logic"},{"key":"2_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/978-3-642-35722-0_9","volume-title":"Logical Foundations of Computer Science","author":"A. Ciabattoni","year":"2013","unstructured":"Ciabattoni, A., Lahav, O., Spendier, L., Zamansky, A.: Automated support for the investigation of paraconsistent and other logics. In: Artemov, S., Nerode, A. (eds.) LFCS 2013. LNCS, vol.\u00a07734, pp. 119\u2013133. Springer, Heidelberg (2013)"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Ciabattoni, A., Lahav, O., Spendier, L., Zamansky, A.: Taming paraconsistent (and other) logics: An algorithmic approach (submitted 2014)","DOI":"10.1145\/2661636"},{"key":"2_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-40537-2_9","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"A. Ciabattoni","year":"2013","unstructured":"Ciabattoni, A., Maffezioli, P., Spendier, L.: Hypersequent and labelled calculi for intermediate logics. In: Galmiche, D., Larchey-Wendling, D. (eds.) TABLEAUX 2013. LNCS, vol.\u00a08123, pp. 81\u201396. Springer, Heidelberg (2013)"},{"key":"2_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/978-3-642-39992-3_10","volume-title":"Logic, Language, Information, and Computation","author":"A. Ciabattoni","year":"2013","unstructured":"Ciabattoni, A., Ramanayake, R.: Structural extensions of display calculi: A general recipe. In: Libkin, L., Kohlenbach, U., de Queiroz, R. (eds.) WoLLIC 2013. LNCS, vol.\u00a08071, pp. 81\u201395. Springer, Heidelberg (2013)"},{"key":"2_CR17","unstructured":"Cintula, P., H\u00e1jek, P., Noguera, C. (eds.): Handbook of Mathematical Fuzzy Logic, vol. 1. Studies in Logic, Mathematical Logic and Foundations, vol.\u00a037. College Publications (2011)"},{"key":"2_CR18","unstructured":"Galatos, N., Jipsen, P., Kowalski, T., Ono, H.: Residuated Lattices: An algebraic glimpse at substructural logics. Studies in Logics and the Foundations of Mathematics. Elsevier (2007)"},{"issue":"2","key":"2_CR19","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1015122331293","volume":"70","author":"S. Jenei","year":"2002","unstructured":"Jenei, S., Montagna, F.: A proof of standard completeness for Esteva and Godo\u2019s MTL logic. Studia Logica\u00a070(2), 183\u2013192 (2002)","journal-title":"Studia Logica"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"H\u00e1jek, P.: Metamathematics of Fuzzy Logic. Springer (1998)","DOI":"10.1007\/978-94-011-5300-3"},{"key":"2_CR21","series-title":"LNCS (LNAI)","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/978-3-319-08587-6_6","volume-title":"Automated Reasoning","author":"O. Lahav","year":"2014","unstructured":"Lahav, O., Zohar, Y.: SAT-based decision procedure for analytic pure sequent calculi. In: Demri, S., Kapur, D., Weidenbach, C. (eds.) IJCAR 2014. LNCS (LNAI), vol.\u00a08562, pp. 76\u201390. Springer, Heidelberg (2014)"},{"issue":"3","key":"2_CR22","doi-asserted-by":"publisher","first-page":"834","DOI":"10.2178\/jsl\/1191333844","volume":"7","author":"G. Metcalfe","year":"2007","unstructured":"Metcalfe, G., Montagna, F.: Substructural fuzzy logics. Journal of Symbolic Logic\u00a07(3), 834\u2013864 (2007)","journal-title":"Journal of Symbolic Logic"},{"key":"2_CR23","unstructured":"Nigam, V., Pimentel, E., Reis, G.: An extended framework for specifying and reasoning about proof systems. Journal of Logic and Computation (accepted)"},{"issue":"1","key":"2_CR24","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1093\/jigpal\/4.1.109","volume":"4","author":"H.J. Ohlbach","year":"1996","unstructured":"Ohlbach, H.J.: Computer support for the development and investigation of logics. Logic Journal of the IGPL\u00a04(1), 109\u2013127 (1996)","journal-title":"Logic Journal of the IGPL"},{"key":"2_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-642-33353-8_41","volume-title":"Logics in Artificial Intelligence","author":"D. Tishkovsky","year":"2012","unstructured":"Tishkovsky, D., Schmidt, R.A., Khodadadi, M.: The tableau prover generator MetTeL2. In: del Cerro, L.F., Herzig, A., Mengin, J. (eds.) JELIA 2012. LNCS, vol.\u00a07519, pp. 492\u2013495. Springer, Heidelberg (2012)"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge University Press (2000)","DOI":"10.1017\/CBO9781139168717"},{"key":"2_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-540-71067-7_7","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Wenzel","year":"2008","unstructured":"Wenzel, M., Paulson, L.C., Nipkow, T.: The Isabelle Framework. In: Mohamed, O.A., Mu\u00f1oz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol.\u00a05170, pp. 33\u201338. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Logics in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-11558-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,2]],"date-time":"2024-06-02T14:24:02Z","timestamp":1717338242000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-11558-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319115573","9783319115580"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-11558-0_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}