{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:51:35Z","timestamp":1725475895479},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540676973"},{"type":"electronic","value":"9783540450085"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10722086_15","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T00:43:15Z","timestamp":1167439395000},"page":"160-174","source":"Crossref","is-referenced-by-count":3,"title":["Hypertableau and Path-Hypertableau Calculi for some Families of Intermediate Logics"],"prefix":"10.1007","author":[{"given":"Agata","family":"Ciabattoni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauro","family":"Ferrari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"15_CR1","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1093\/jigpal\/7.4.447","volume":"7","author":"A. Avellone","year":"1999","unstructured":"Avellone, A., Ferrari, M., Miglioli, P.: Duplication-free tableau calculi and related cut-free sequent calculi for the interpolable propositional intermediate logics. Logic Journal of the IGPL\u00a07(4), 447\u2013480 (1999)","journal-title":"Logic Journal of the IGPL"},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"939","DOI":"10.2307\/2273828","volume":"52","author":"A. Avron","year":"1987","unstructured":"Avron, A.: A constructive analysis of RM. J. Symbolic Logic\u00a052, 939\u2013951 (1987)","journal-title":"J. Symbolic Logic"},{"key":"15_CR3","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"},{"key":"15_CR4","first-page":"1","volume-title":"Logic: from Foundations to Applications, European Logic Colloquium","author":"A. Avron","year":"1996","unstructured":"Avron, A.: The method of hypersequents in the proof theory of propositional nonclassical logics. In: Logic: from Foundations to Applications, European Logic Colloquium, pp. 1\u201332. Oxford University Press, Oxford (1996)"},{"key":"15_CR5","series-title":"LNAI","first-page":"1","volume-title":"Logics in Artificial Intelligence","author":"P. Baumgartner","year":"1996","unstructured":"Baumgartner, P., Furbach, U., Niemelae, I.: Hyper Tableaux. In: Or\u0142owska, E., Alferes, J.J., Moniz Pereira, L. (eds.) JELIA 1996. LNCS (LNAI), vol.\u00a01126, pp. 1\u201317. Springer, Heidelberg (1996)"},{"key":"15_CR6","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/3-540-48754-9_8","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"M. Baaz","year":"1999","unstructured":"Baaz, M., Ferm\u00fcller, C.G.: Analytic calculi for projective logics. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS (LNAI), vol.\u00a01617, pp. 36\u201351. Springer, Heidelberg (1999)"},{"key":"15_CR7","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. Oxford University Press, Oxford (1997)"},{"doi-asserted-by":"crossref","unstructured":"Ciabattoni, A., Ferrari, M.: Hypersequent calculi for some intermediate logics with bounded Kripke models. Journal of Logic and Computation (to appear)","key":"15_CR8","DOI":"10.1093\/logcom\/11.2.283"},{"issue":"4","key":"15_CR9","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s005000050047","volume":"2","author":"A. Ciabattoni","year":"1998","unstructured":"Ciabattoni, A., Gabbay, D.M., Olivetti, N.: Cut-free proof systems for logics of weak excluded middle. Soft Computing\u00a02(4), 147\u2013156 (1998)","journal-title":"Soft Computing"},{"key":"15_CR10","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1093\/jigpal\/7.3.319","volume":"7","author":"R. Dyckhoff","year":"1999","unstructured":"Dyckhoff, R.: A deterministic terminating sequent calculus for G\u00f6del-Dummett logic. Logic J. of the IGPL\u00a07, 319\u2013326 (1999)","journal-title":"Logic J. of the IGPL"},{"key":"15_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-2794-5","volume-title":"Proof Methods for Modal and Intuitionistic Logics","author":"M.C. Fitting","year":"1983","unstructured":"Fitting, M.C.: Proof Methods for Modal and Intuitionistic Logics. Reidel, Dordrecht (1983)"},{"key":"15_CR12","volume-title":"Semantical Investigations in Heyting\u2019s Intuitionistic Logic","author":"D.M. Gabbay","year":"1983","unstructured":"Gabbay, D.M.: Semantical Investigations in Heyting\u2019s Intuitionistic Logic. Reidel, Dordrecht (1983)"},{"unstructured":"Gabbay, D.M., Olivetti, N.: Goal-Directed Proof Theory. Kluwer, Dordrecht (to appear)","key":"15_CR13"},{"key":"15_CR14","volume-title":"Automated Deduction in Multiple-valued Logics","author":"R. H\u00e4hnle","year":"1993","unstructured":"H\u00e4hnle, R.: Automated Deduction in Multiple-valued Logics. Oxford University Press, Oxford (1993)"},{"key":"15_CR15","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/BF01670006","volume":"16","author":"L. Maksimova","year":"1977","unstructured":"Maksimova, L.: Craig\u2019s theorem in superintuitionistic logics and amalgamable varieties of pseudo-boolean algebras. Algebra and Logic\u00a016, 427\u2013455 (1977)","journal-title":"Algebra and Logic"},{"issue":"1","key":"15_CR16","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1093\/jigpal\/5.1.145","volume":"5","author":"P. Miglioli","year":"1997","unstructured":"Miglioli, P., Moscato, U., Ornaghi, M.: Avoiding duplications in tableau systems for intuitionistic logic and Kuroda logic. Logic J. of the IGPL\u00a05(1), 145\u2013167 (1997)","journal-title":"Logic J. of the IGPL"},{"key":"15_CR17","first-page":"900","volume":"48","author":"G. Pottinger","year":"1983","unstructured":"Pottinger, G.: Uniform, cut-free formulation of T,S4 and S5 (abstract). J. Symbolic Logic\u00a048, 900 (1983)","journal-title":"J. Symbolic Logic"},{"key":"15_CR18","first-page":"648","volume":"8","author":"V. Jankov","year":"1968","unstructured":"Jankov, V.: The calculus of the weak \u201dlaw of excluded middle\u201d. Mathematics of the USSR\u00a08, 648\u2013658 (1968)","journal-title":"Mathematics of the USSR"},{"unstructured":"Rousseau, G.: Sequent in many valued logic, I and II. Fund. Math. 60 and 67, 23\u201333 (1967), 125\u2013131 (1970)","key":"15_CR19"},{"key":"15_CR20","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-86718-7","volume-title":"First-Order Logic","author":"R.M. Smullyan","year":"1968","unstructured":"Smullyan, R.M.: First-Order Logic. Springer, Berlin (1968)"}],"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\/10722086_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,9]],"date-time":"2024-02-09T17:43:40Z","timestamp":1707500620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10722086_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676973","9783540450085"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/10722086_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}