{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:47:41Z","timestamp":1725558461027},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540408017"},{"type":"electronic","value":"9783540452201"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45220-1_33","type":"book-chapter","created":{"date-parts":[[2010,6,25]],"date-time":"2010-06-25T23:33:58Z","timestamp":1277508838000},"page":"413-426","source":"Crossref","is-referenced-by-count":5,"title":["Goal-Directed Calculi for G\u00f6del-Dummett Logics"],"prefix":"10.1007","author":[{"given":"George","family":"Metcalfe","sequence":"first","affiliation":[]},{"given":"Nicola","family":"Olivetti","sequence":"additional","affiliation":[]},{"given":"Dov","family":"Gabbay","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"33_CR1","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/s001530100118","volume":"41","author":"S. Aguzzoli","year":"2002","unstructured":"Aguzzoli, S., Gerla, B.: Finite-valued reductions of infinite-valued logics. Archive for Mathematical Logic\u00a041(4), 361\u2013399 (2002)","journal-title":"Archive for Mathematical Logic"},{"issue":"4","key":"33_CR2","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"},{"issue":"3\u20134","key":"33_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(3\u20134), 225\u2013248 (1991)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"issue":"2","key":"33_CR4","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1023\/A:1013813806341","volume":"69","author":"A. Avron","year":"2001","unstructured":"Avron, A., Konikowska, B.: Decomposition Proof Systems for G\u00f6del-Dummett Logics. Studia Logica\u00a069(2), 197\u2013219 (2001)","journal-title":"Studia Logica"},{"key":"33_CR5","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\u201350. Springer, Heidelberg (1999)"},{"key":"33_CR6","doi-asserted-by":"publisher","first-page":"1355","DOI":"10.1016\/B978-044450813-3\/50022-9","volume-title":"Handbook of Automated Reasoning","author":"M. Baaz","year":"2001","unstructured":"Baaz, M., Ferm\u00fcller, C.G., Salzer, G.: Automated deduction for many-valued logics. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, vol.\u00a0II, ch. 20, pp. 1355\u20131402. Elsevier Science B.V., Amsterdam (2001)"},{"key":"33_CR7","doi-asserted-by":"publisher","first-page":"97","DOI":"10.2307\/2964753","volume":"24","author":"M. Dummett","year":"1959","unstructured":"Dummett, M.: A propositional calculus with denumerable matrix. Journal of Symbolic Logic\u00a024, 97\u2013106 (1959)","journal-title":"Journal of Symbolic Logic"},{"key":"33_CR8","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. Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik\u00a017, 225\u2013230 (1971)","journal-title":"Zeitschrift f\u00fcr Mathematische Logik und Grundlagen der Mathematik"},{"issue":"3","key":"33_CR9","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 Journal of the IGPL\u00a07(3), 319\u2013326 (1999)","journal-title":"Logic Journal of the IGPL"},{"issue":"3","key":"33_CR10","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1023\/A:1017515831550","volume":"27","author":"G. Fiorino","year":"2001","unstructured":"Fiorino, G.: An o(nlog n)-space decision procedure for the propositional Dummett logic. Journal of Automated Reasoning\u00a027(3), 297\u2013311 (2001)","journal-title":"Journal of Automated Reasoning"},{"key":"33_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-2977-2","volume-title":"Semantical Investigations in Heyting\u2019s Intuitionistic Logic","author":"D. Gabbay","year":"1981","unstructured":"Gabbay, D.: Semantical Investigations in Heyting\u2019s Intuitionistic Logic. Reidel, Dordrecht (1981)"},{"key":"33_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-017-1713-7","volume-title":"Goal-directed Proof Theory","author":"D. Gabbay","year":"2000","unstructured":"Gabbay, D., Olivetti, N.: Goal-directed Proof Theory. Kluwer Academic Publishers, Dordrecht (2000)"},{"key":"33_CR13","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-94-017-0464-9_4","volume-title":"Handbook of Philosopophical Logic","author":"D. Gabbay","year":"2002","unstructured":"Gabbay, D., Olivetti, N.: Goal oriented deductions. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosopophical Logic, 2nd edn., vol.\u00a09, pp. 199\u2013285. Kluwer Academic Publishers, Dordrecht (2002)","edition":"2"},{"key":"33_CR14","first-page":"65","volume":"32","author":"K. G\u00f6del","year":"1932","unstructured":"G\u00f6del, K.: Zum intuitionisticschen Aussagenkalk\u00fcl. Anzeiger Akademie der Wissenschaften Wien, mathematisch-naturwiss. Klasse\u00a032, 65\u201366 (1932)","journal-title":"Anzeiger Akademie der Wissenschaften Wien, mathematisch-naturwiss. Klasse"},{"key":"33_CR15","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":"33_CR16","doi-asserted-by":"crossref","DOI":"10.1007\/978-94-011-5300-3","volume-title":"Metamathematics of Fuzzy Logic","author":"P. H\u00e1jek","year":"1998","unstructured":"H\u00e1jek, P.: Metamathematics of Fuzzy Logic. Kluwer Academic Publishers, Dordrecht (1998)"},{"key":"33_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/3-540-45620-1_7","volume-title":"Automated Deduction - CADE-18","author":"D. Larchey-Wendling","year":"2002","unstructured":"Larchey-Wendling, D.: Combining proof-search and counter-model construction for deciding g\u00f6del-dummett logic. In: Voronkov, A. (ed.) CADE 2002. LNCS (LNAI), vol.\u00a02392, p. 94. Springer, Heidelberg (2002)"},{"issue":"4","key":"33_CR18","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1145\/383779.383783","volume":"2","author":"V. Lifschitz","year":"2001","unstructured":"Lifschitz, V., Pearce, D., Valverde, A.: Strongly equivalent logic programs. ACM Transactions on Computational Logic\u00a02(4), 526\u2013541 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"33_CR19","unstructured":"Metcalfe, G., Olivetti, N., Gabbay, D.: Sequent and hypersequent calculi for abelian and \u0141ukasiewicz logics (submitted)"},{"key":"33_CR20","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0168-0072(91)90068-W","volume":"51","author":"D. Miller","year":"1991","unstructured":"Miller, D., Nadathur, G., Pfenning, F., Scedrov, A.: Uniform proofs as a foundation for logic programming. Annals of Pure and Applied Logic\u00a051, 125\u2013157 (1991)","journal-title":"Annals of Pure and Applied Logic"},{"key":"33_CR21","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":"33_CR22","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","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45220-1_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T03:05:05Z","timestamp":1552619105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45220-1_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540408017","9783540452201"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45220-1_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}