{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,15]],"date-time":"2025-08-15T01:21:49Z","timestamp":1755220909356,"version":"3.43.0"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"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":["Studia Logica"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1023\/a:1013813806341","type":"journal-article","created":{"date-parts":[[2003,3,20]],"date-time":"2003-03-20T21:15:11Z","timestamp":1048194911000},"page":"197-219","source":"Crossref","is-referenced-by-count":22,"title":["Decomposition Proof Systems for G\u00f6del-Dummett Logics"],"prefix":"10.1007","volume":"69","author":[{"given":"Arnon","family":"Avron","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beata","family":"Konikowska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"389683_CR1","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1093\/jigpal\/7.4.447","volume":"7","author":"A. Avellone","year":"1999","unstructured":"Avellone, A., M. Ferrari, P. Miglioli. Duplication-free Tableaux Calculi Together with Cut-free and Contraction-free Sequent Calculi for the Interpolable Propositional Intermediate Logics. Logic J. IGPL, 7:447-480, 1999.","journal-title":"Logic J. IGPL"},{"key":"389683_CR2","doi-asserted-by":"crossref","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, 4:225-248, 1991.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"389683_CR3","doi-asserted-by":"crossref","unstructured":"Avron, A. A Tableaux System for G\u00f6del-Dummett Logic Based on a Hypersequential Calculus. In Proc. of TABLEAUX'2000, LNAI 1847 (R. Dyckhoff, Ed.) Springer Verlag, pp. 98-111, 2000.","DOI":"10.1007\/10722086_11"},{"key":"389683_CR4","first-page":"36","volume-title":"Proc. of TABLEAUX'99","author":"M. Baaz","year":"1999","unstructured":"Baaz, M., G. C. Ferm\u00fcller. Analytic Calculi for Projective Logics. In Proc. of TABLEAUX'99, LNCS 1617, pp. 36-50, Springer-Verlag, Berlin, 1999."},{"key":"389683_CR5","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1002\/malq.19710170126","volume":"17","author":"J.M. Dunn","year":"1971","unstructured":"Dunn, J.M., R.K. Meyer. Algebraic Completeness Results for Dummett's LC and its extensions. Z. math. Logik und Grundlagen der Mathematik, 17:225-230, 1971.","journal-title":"Z. math. Logik und Grundlagen der Mathematik"},{"key":"389683_CR6","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, 24:96-107, 1959.","journal-title":"Journal of Symbolic Logic"},{"key":"389683_CR7","doi-asserted-by":"crossref","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, 7:319-326, 1999.","journal-title":"Logic J. IGPL"},{"key":"389683_CR8","unstructured":"G\u00f6del, K. On the Intuitionistic Propositional Calculus, 1933. In Collected Work, Vol. 1, edited by S. Feferman et al, Oxford University Press, 1986."},{"key":"389683_CR9","doi-asserted-by":"crossref","unstructured":"Hajek, P. Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, 1998.","DOI":"10.1007\/978-94-011-5300-3"},{"key":"389683_CR10","first-page":"183","volume-title":"Proceedings WADT'98","author":"B. Konikowska","year":"1999","unstructured":"Konikowska, B. Rasiowa-Sikorski deduction system: a handy tool for Computer Science Logic. In Proceedings WADT'98, LNCS 1589, pp. 183-197, Springer-Verlag, Berlin, 1999."},{"key":"389683_CR11","unstructured":"Konikowska, B. Rasiowa-Sikorski Deduction Systems in Computer Science Applications. To appear in a Special Issue of Theoretical Computer Science."},{"key":"389683_CR12","unstructured":"Konikowska, B. Rasiowa-Sikorski Deduction Systems: Fundamentals and Applications. Tutorial at the Tableaux 2000 Conference, St Andrews, Scotland, July 4\u20137 2000, http:\/\/www.dcs.st-and.ac.uk\/~tab2000\/Tutorials\/Konikowska.ps."},{"key":"389683_CR13","volume-title":"The mathematics of metamathematics","author":"H. R. Rasiowa","year":"1963","unstructured":"Rasiowa, H., R. Sikorski. The mathematics of metamathematics. Warsaw, PWN (Polish Scientific Publishers), 1963."},{"key":"389683_CR14","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, 7:7-14, 1975.","journal-title":"Journal of Tsuda College"},{"key":"389683_CR15","doi-asserted-by":"crossref","unstructured":"Troelstra, A.S., H. Schwichtenberg. Basic Proof Theory,\nen2nd Edition. Cambridge University Press, 2000.","DOI":"10.1017\/CBO9781139168717"},{"key":"389683_CR16","doi-asserted-by":"crossref","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's arithmetic. Annals of Mathematical Logic, 22:263-295, 1982.","journal-title":"Annals of Mathematical Logic"}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013813806341.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013813806341\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013813806341.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,8]],"date-time":"2025-08-08T05:12:53Z","timestamp":1754629973000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013813806341"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["389683"],"URL":"https:\/\/doi.org\/10.1023\/a:1013813806341","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"type":"print","value":"0039-3215"},{"type":"electronic","value":"1572-8730"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}