{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:08:15Z","timestamp":1725484095389},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540439295"},{"type":"electronic","value":"9783540456162"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45616-3_9","type":"book-chapter","created":{"date-parts":[[2007,5,17]],"date-time":"2007-05-17T04:26:55Z","timestamp":1179376015000},"page":"115-129","source":"Crossref","is-referenced-by-count":0,"title":["Tableau Calculi for the Logics of Finite k-Ary Trees"],"prefix":"10.1007","author":[{"given":"Mauro","family":"Ferrari","sequence":"first","affiliation":[]},{"given":"Camillo","family":"Fiorentini","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Fiorino","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,7,9]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1093\/jigpal\/7.4.447","volume":"7","author":"A. Avellone","year":"1999","unstructured":"A. Avellone, M. Ferrari, and P. Miglioli. Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics. Logic Journal of the IGPL, 7(4):447\u2013480, 1999.","journal-title":"Logic Journal of the IGPL"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"A. Avellone, P. Miglioli, U. Moscato, and M. Ornaghi. Generalized tableau systems for intermediate propositional logics. In D. Galmiche, editor, Proceedings of the 6th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods: Tableaux\u2019 97, volume 1227 of LNAI, pages 43\u201361. Springer-Verlag, 1997.","DOI":"10.1007\/BFb0027404"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01531058","volume":"4","author":"A. Avron","year":"1991","unstructured":"A. Avron. Hypersequents, logical consequence and intermediate logics for concurrency. Annals for Mathematics and Artificial Intelligence, 4:225\u2013248, 1991.","journal-title":"Annals for Mathematics and Artificial Intelligence"},{"key":"9_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1007\/3-540-48754-9_8","volume-title":"Analytic calculi for projective logics","author":"M. Baaz","year":"1999","unstructured":"M. Baaz and C. G. Ferm\u00fcller. Analytic calculi for projective logics. Lecture Notes in Computer Science, 1617:36\u201350, 1999."},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"A. Chagrov and M. Zakharyaschev. Modal Logic. Oxford University Press, 1997.","DOI":"10.1093\/oso\/9780198537793.001.0001"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"A. Ciabattoni and M. Ferrari. Hypertableau and path-hypertableau calculi for some families of intermediate logics. In R. Dyckhoff, editor, TABLEAUX 2000, Automated Reasoning with Analytic Tableaux and Related Methods, volume 1947 of LNAI, pages 160\u2013174. Springer-Verlag, 2000.","DOI":"10.1007\/10722086_15"},{"issue":"2","key":"9_CR7","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1093\/logcom\/11.2.283","volume":"11","author":"A. Ciabattoni","year":"2001","unstructured":"A. Ciabattoni and M. Ferrari. Hypersequent calculi for some intermediate logics with bounded Kripke models. Journal of Logic and Computation, 11(2):283\u2013294, 2001.","journal-title":"Journal of Logic and Computation"},{"issue":"3","key":"9_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1093\/jigpal\/7.3.319","volume":"7","author":"R. Dyckhoff","year":"1999","unstructured":"R. Dyckhoff. A deterministic terminating sequent calculus for G\u00f6del-Dummett logic. Logic Journal of the IGPL, 7(3):319\u2013326, 1999.","journal-title":"Logic Journal of the IGPL"},{"issue":"4","key":"9_CR9","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.2307\/2275149","volume":"58","author":"M. Ferrari","year":"1993","unstructured":"M. Ferrari and P. Miglioli. Counting the maximal intermediate constructive logics. Journal of Symbolic Logic, 58(4):1365\u20131401, 1993.","journal-title":"Journal of Symbolic Logic"},{"issue":"3","key":"9_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1017515831550","volume":"27","author":"G. Fiorino","year":"2001","unstructured":"G. Fiorino. An O(n log n)-space decision procedure for the propositional Dummett Logic. Journal of Automated Reasoning, 27(3):297\u2013311, 2001.","journal-title":"Journal of Automated Reasoning"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"G. Fiorino. Space-efficient Decision Procedures for Three Interpolable Propositional Intermediate Logics. Journal of Logic and Computation, To appear.","DOI":"10.1093\/logcom\/12.6.955"},{"key":"9_CR12","unstructured":"M.C. Fitting. Intuitionistic Logic, Model Theory and Forcing. North-Holland, 1969."},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"67","DOI":"10.2307\/2272344","volume":"39","author":"D.M. Gabbay","year":"1974","unstructured":"D.M. Gabbay and D.H.J. De Jongh. A sequence of decidable finitely axiomatizable intermediate logics with the disjunction property. Journal of Symbolic Logic, 39:67\u201378, 1974.","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"P. H\u00e1jek. Metamathematics of fuzzy logic. Kluwer, 1998.","DOI":"10.1007\/978-94-011-5300-3"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"D. Pearce. A new logical characterization of stable models and answer sets. In J. Dix, L.M. Pereira, and T. Przymusinski, editors, Non-Monotonic Extensions of Logic Programming, volume 1216 of LNAI, pages 57\u201370. Springer-Verlag, 1997.","DOI":"10.1007\/BFb0023801"},{"issue":"1","key":"9_CR16","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/S0743-1066(98)10015-8","volume":"38","author":"D. Pearce","year":"1999","unstructured":"D. Pearce. Stable inference as intuitionistic validity. Journal of Logic Programming, 38(1):79\u201391, 1999.","journal-title":"Journal of Logic Programming"}],"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\/3-540-45616-3_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T10:18:52Z","timestamp":1707905932000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45616-3_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540439295","9783540456162"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-45616-3_9","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}