{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:51:33Z","timestamp":1725475893304},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_11","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T00:43:15Z","timestamp":1167439395000},"page":"98-111","source":"Crossref","is-referenced-by-count":7,"title":["A Tableau System for G\u00f6del-Dummett Logic Based on a Hypersequent Calculus"],"prefix":"10.1007","author":[{"given":"Arnon","family":"Avron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_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 Tableaux Calculi Together with Cut-free and Contraction-free Sequent Calculi for the Interpolable Propositional Intermediate Logics. Logic J. IGPL\u00a07, 447\u2013480 (1999)","journal-title":"Logic J. IGPL"},{"key":"11_CR2","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01531058","volume":"4","author":"A. Avron","year":"1991","unstructured":"Avron, A.: Using Hypersequents in Proof Systems for Non-classical Logics. Annals of Mathematics and Artificial Intelligence\u00a04, 225\u2013248 (1991)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"11_CR3","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, G.C.: Analytic Calculi for Projective Logics. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS (LNAI), vol.\u00a01617, pp. 36\u201350. Springer, Heidelberg (1999)"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/malq.19710170126","volume":"17","author":"J.M. Dunn","year":"1971","unstructured":"Dunn, J.M., Meyer, R.K.: Algebraic Completeness Results for Dummett\u2019s LC and its extensions. Z. math. Logik und Grundlagen der Mathematik\u00a017, 225\u2013230 (1971)","journal-title":"Z. math. Logik und Grundlagen der Mathematik"},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1017\/S0022481200125848","volume":"24","author":"M. Dummett","year":"1959","unstructured":"Dummett, M.: A Propositional Calculus with a Denumerable matrix. Journal of Symbolic Logic\u00a024, 96\u2013107 (1959)","journal-title":"Journal of Symbolic Logic"},{"key":"11_CR6","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. IGPL\u00a07, 319\u2013326 (1999)","journal-title":"Logic J. IGPL"},{"key":"11_CR7","first-page":"40","volume":"4","author":"K. G\u00f6del","year":"1933","unstructured":"G\u00f6del, K.: Zum intuitionistischen Aussagenkalk\u00fcl, Ergeb. Math. Koll.\u00a04, 40 (1933)","journal-title":"Math. Koll"},{"key":"11_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-5300-3","volume-title":"Metamathematics of Fuzzy Logic","author":"P. Hajek","year":"1998","unstructured":"Hajek, P.: Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"11_CR9","first-page":"7","volume":"7","author":"O. Sonobe","year":"1975","unstructured":"Sonobe, O.: A Gentzen-type Formulation of Some Intermediate Propositional Logics. Journal of Tsuda College\u00a07, 7\u201314 (1975)","journal-title":"Journal of Tsuda College"},{"key":"11_CR10","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0003-4843(82)90024-9","volume":"22","author":"A. Visser","year":"1982","unstructured":"Visser, A.: On the Completeness Principle: A study of provability in Heyting\u2019s arithmetic. Annals of Mathematical Logic\u00a022, 263\u2013295 (1982)","journal-title":"Annals of Mathematical Logic"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,23]],"date-time":"2019-03-23T09:33:18Z","timestamp":1553333598000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10722086_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676973","9783540450085"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/10722086_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}