{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:08:41Z","timestamp":1725516521962},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642326202"},{"type":"electronic","value":"9783642326219"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32621-9_24","type":"book-chapter","created":{"date-parts":[[2012,8,18]],"date-time":"2012-08-18T10:40:40Z","timestamp":1345286440000},"page":"321-335","source":"Crossref","is-referenced-by-count":1,"title":["Classic-Like Cut-Based Tableau Systems for Finite-Valued Logics"],"prefix":"10.1007","author":[{"given":"Marco","family":"Volpe","sequence":"first","affiliation":[]},{"given":"Jo\u00e3o","family":"Marcos","sequence":"additional","affiliation":[]},{"given":"Carlos","family":"Caleiro","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","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. Journ. of Logic and Computation\u00a015, 241\u2013261 (2005)","journal-title":"Journ. of Logic and Computation"},{"key":"24_CR2","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF00247711","volume":"13","author":"G. Boolos","year":"1984","unstructured":"Boolos, G.: Don\u2019t eliminate cut. Journ. of Phil. Logic\u00a013, 373\u2013378 (1984)","journal-title":"Journ. of Phil. Logic"},{"key":"24_CR3","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/3-7643-7304-0_10","volume-title":"Log. Universalis","author":"C. Caleiro","year":"2005","unstructured":"Caleiro, C., Carnielli, W., Coniglio, M.E., Marcos, J.: Two\u2019s company: The humbug of many logical values. In: B\u00e9ziau, J.-Y. (ed.) Log. Universalis, pp. 169\u2013189. Birkh\u00e4user Verlag, Basel (2005)"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/978-3-642-02261-6_22","volume-title":"Logic, Language, Information and Computation","author":"C. Caleiro","year":"2009","unstructured":"Caleiro, C., Marcos, J.: Classic-Like Analytic Tableaux for Finite-Valued Logics. In: Ono, H., Kanazawa, M., de Queiroz, R. (eds.) WoLLIC 2009. LNCS, vol.\u00a05514, pp. 268\u2013280. Springer, Heidelberg (2009)"},{"key":"24_CR5","unstructured":"Caleiro, C., Marcos, J.: Many-valuedness meets bivalence: Using logical values in an effective way. J. of Multiple-Valued Log. and Soft Comp.\u00a018 (2012)"},{"key":"24_CR6","series-title":"PRG Techn. Monogr. 88","volume-title":"Investigations into the complexity of some propositional calculi","author":"M. D\u2019Agostino","year":"1990","unstructured":"D\u2019Agostino, M.: Investigations into the complexity of some propositional calculi. PRG Techn. Monogr. 88. Oxford Univ., Computing Lab, Oxford (1990)"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/BF00156916","volume":"1","author":"M. D\u2019Agostino","year":"1992","unstructured":"D\u2019Agostino, M.: Are tableaux an improvement on truth-tables? Cut-free proofs and bivalence. Journ. of Log., Lang., and Inform.\u00a01, 235\u2013252 (1992)","journal-title":"Journ. of Log., Lang., and Inform."},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"D\u2019Agostino, M.: Tableau methods for classical propositional logic. In: Handbook of Tableau Methods, pp. 45\u2013123. Kluwer Academic Publishers (1999)","DOI":"10.1007\/978-94-017-1754-0_2"},{"issue":"3","key":"24_CR9","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1093\/logcom\/4.3.285","volume":"4","author":"M. D\u2019Agostino","year":"1994","unstructured":"D\u2019Agostino, M., Mondadori, M.: The taming of the cut: Classical refutations with analytic cut. Journ. of Log. and Comp.\u00a04(3), 285\u2013319 (1994)","journal-title":"Journ. of Log. and Comp."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10849-005-9001-y","volume":"15","author":"M. Finger","year":"2006","unstructured":"Finger, M., Gabbay, D.: Cut and pay. Journ. of Logic, Language and Information\u00a015, 195\u2013218 (2006)","journal-title":"Journ. of Logic, Language and Information"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"H\u00e4hnle, R.: Automated Deduction in Multiple-Valued Logics. International Series of Monographs on Computer Science, vol.\u00a010. Oxford University Press (1994)","DOI":"10.1093\/oso\/9780198539896.001.0001"},{"key":"24_CR12","first-page":"425","volume-title":"The Many Sides of Logic","author":"J. Marcos","year":"2009","unstructured":"Marcos, J., Mendon\u00e7a, D.: Towards fully automated axiom extraction for finite-valued logics. In: Carnielli, W., et al. (eds.) The Many Sides of Logic, pp. 425\u2013440. College Publications, London (2009)"}],"container-title":["Lecture Notes in Computer Science","Logic, Language, Information and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32621-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,28]],"date-time":"2024-04-28T14:02:35Z","timestamp":1714312955000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32621-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642326202","9783642326219"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32621-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}