{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:21:23Z","timestamp":1759033283452},"publisher-location":"Berlin, Heidelberg","reference-count":21,"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_12","type":"book-chapter","created":{"date-parts":[[2006,12,30]],"date-time":"2006-12-30T00:43:15Z","timestamp":1167439395000},"page":"112-126","source":"Crossref","is-referenced-by-count":0,"title":["An Analytic Calculus for Quantified Propositional G\u00f6del Logic"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Baaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Ferm\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Helmut","family":"Veith","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","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":"12_CR2","first-page":"1","volume-title":"Logic: From Foundations to Applications. European Logic Colloquium, Keele","author":"A. Avron","year":"1996","unstructured":"Avron, A.: The Method of Hypersequents in Proof Theory of Propositional Non- Classical Logics. In: Logic: From Foundations to Applications. European Logic Colloquium, Keele, UK, July 20-29, pp. 1\u201332. Clarendon Press, Oxford (1996)"},{"key":"12_CR3","series-title":"LNML","first-page":"23","volume-title":"Proceedings of G\u00f6del 1996 - Kurt G\u00f6del\u2019s Legacy","author":"M. Baaz","year":"1996","unstructured":"Baaz, M.: Infinite-Valued G\u00f6del Logics with 0-1-Projections and Relativizations. In: Proceedings of G\u00f6del 1996 - Kurt G\u00f6del\u2019s Legacy. LNML, vol.\u00a06, pp. 23\u201333. Springer, Heidelberg (1996)"},{"key":"12_CR4","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.: Analytic Calculi for Projective Logics. In: Murray, N.V. (ed.) TABLEAUX 1999. LNCS (LNAI), vol.\u00a01617, pp. 36\u201350. Springer, Heidelberg (1999)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0055769","volume-title":"Mathematical Foundations of Computer Science 1998","author":"M. Baaz","year":"1998","unstructured":"Baaz, M., Ciabattoni, A., Ferm\u00fcller, C., Veith, H.: Proof Theory of Fuzzy Logics: Urquhart\u2019s C and Related Logics. In: Brim, L., Gruska, J., Zlatu\u0161ka, J. (eds.) MFCS 1998. LNCS, vol.\u00a01450, pp. 203\u2013212. Springer, Heidelberg (1998)"},{"key":"12_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"258","DOI":"10.1007\/3-540-46691-6_20","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"M. Baaz","year":"1999","unstructured":"Baaz, M., Ciabattoni, A., Ferm\u00fcller, C., Veith, H.: On the Undecidability of Some Sub-classical First-order Logics. In: Pandu Rangan, C., Raman, V., Sarukkai, S. (eds.) FST TCS 1999. LNCS, vol.\u00a01738, pp. 258\u2013268. Springer, Heidelberg (1999)"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Baaz, M., Veith, H.: Interpolation in Fuzzy Logic. Archive for Mathematical Logic (to appear)","DOI":"10.1007\/s001530050151"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1007\/10703163_27","volume-title":"Computer Science Logic","author":"M. Baaz","year":"1999","unstructured":"Baaz, M., Veith, H.: Quantifier Elimination in Fuzzy Logic. In: Gottlob, G., Grandjean, E., Seyr, K. (eds.) CSL 1998. LNCS, vol.\u00a01584, pp. 399\u2013414. Springer, Heidelberg (1999)"},{"key":"12_CR9","series-title":"LNML","volume-title":"Proc. Logic Colloquium 1998","author":"M. Baaz","year":"1998","unstructured":"Baaz, M., Veith, H.: An Axiomatization of Quantified Propositional G\u00f6del Logic Using the Takeuti-Titani Rule. In: Proc. Logic Colloquium 1998. LNML. Springer, Heidelberg (1998) (to appear)"},{"key":"12_CR10","unstructured":"Ciabattoni, A.: Proof-theoretic Techniques in Many-valued Logics. Doctoral dissertation, University of Milano (1999)"},{"key":"12_CR11","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. J. Symbolic Logic\u00a024, 97\u2013106 (1959)","journal-title":"J. Symbolic Logic"},{"key":"12_CR12","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":"12_CR13","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, 319\u2013326 (1999)","journal-title":"Logic Journal of the IGPL"},{"key":"12_CR14","unstructured":"Egly, U., Eiter, T., Tompits, H., Woltran, S.: Quantified Boolean logic as framework for non-monotonic reasoning. Unpublished manuscript, Vienna (1999)"},{"key":"12_CR15","first-page":"65","volume":"69","author":"K. G\u00f6del","year":"1932","unstructured":"G\u00f6del, K.: Zum intuitionistischen Aussagenkalk\u00fcl. Anz. Akad. Wiss. Wien\u00a069, 65\u201366 (1932)","journal-title":"Anz. Akad. Wiss. Wien"},{"key":"12_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, Dordrecht (1998)"},{"key":"12_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.2307\/2964111","volume":"27","author":"A. Horn","year":"1962","unstructured":"Horn, A.: Logic with truth values in a linearly ordered Heyting algebra. J. Symbolic Logic\u00a027, 159\u2013170 (1962)","journal-title":"J. Symbolic Logic"},{"key":"12_CR18","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":"12_CR19","first-page":"851","volume":"11","author":"M. Takano","year":"1984","unstructured":"Takano, M.: Another proof of the strong completeness of the intuitionistic fuzzy logic. Tsukuba J. Math.\u00a011, 851\u2013866 (1984)","journal-title":"Tsukuba J. Math."},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"851","DOI":"10.2307\/2274139","volume":"49","author":"G. Takeuti","year":"1984","unstructured":"Takeuti, G., Titani, T.: Intuitionistic fuzzy logic and intuitionistic fuzzy set theory. J. Symbolic Logic\u00a049, 851\u2013866 (1984)","journal-title":"J. Symbolic Logic"},{"key":"12_CR21","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 Math. Logic\u00a022, 263\u2013295 (1982)","journal-title":"Annals of Math. 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_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T05:26:02Z","timestamp":1553405162000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10722086_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676973","9783540450085"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/10722086_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}