{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:46:04Z","timestamp":1725486364617},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540429579"},{"type":"electronic","value":"9783540456537"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45653-8_14","type":"book-chapter","created":{"date-parts":[[2007,6,9]],"date-time":"2007-06-09T00:57:30Z","timestamp":1181350650000},"page":"201-216","source":"Crossref","is-referenced-by-count":19,"title":["Herbrand\u2019s Theorem for Prenex G\u00f6del Logic and Its Consequences for Theorem Proving"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Baaz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Agata","family":"Ciabattoni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian G.","family":"Ferm\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,11,20]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/BF01531058","volume":"4","author":"A. Avron","year":"1991","unstructured":"A. Avron. Hypersequents, Logical Consequence and Intermediate Logics for Concurrency. Annals of Mathematics and Artificial Intelligence Vol. 4, 1991, 225\u2013248.","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"14_CR2","first-page":"1","volume-title":"Logic: From Foundations to Applications. European Logic Colloquium, Keele, UK","author":"A. Avron","year":"1993","unstructured":"A. Avron. 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\u201329, 1993. Oxford, Clarendon Press, 1996, 1\u201332."},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"F. Baader, T. Nipkow. Term Rewriting and All That. Cambridge UP, 1998.","DOI":"10.1017\/CBO9781139172752"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"M. Baaz. Infinite-valued G\u00f6del logics with 0-1-projections and relativizations. In Proceedings G\u00f6del 96. Kurt G\u00f6del\u2019s Legacy. LNL 6, Springer, 23\u201333. 1996.","DOI":"10.1007\/978-3-662-21963-8_2"},{"key":"14_CR5","series-title":"Lect Notes Comput Sci","first-page":"240","volume-title":"Proceedings LPAR 2000","author":"M. Baaz","year":"2000","unstructured":"M. Baaz, A. Ciabattoni, R. Zach. Quantified Propositional G\u00f6del Logics. In Proceedings LPAR 2000. Eds. M. Parigot, A. Voronkov LNCS 1955 Springer, 2000, 240\u2013256"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"M. Baaz, U. Egly, A. Leitsch. Normal Form Transformations. Handbook of Automated Reasoning 1 Eds: A. Robinson, A. Voronkov. Elsevier, 2001, 273\u2013333.","DOI":"10.1016\/B978-044450813-3\/50007-2"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"M. Baaz, C. Ferm\u00fcller. Analytic Calculi for Projective Logics. Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX\u201999, LNAI 1617, Springer, 1999, 36\u201350.","DOI":"10.1007\/3-540-48754-9_8"},{"key":"14_CR8","volume-title":"Proceedings of Computer Science Logic CSL\u201995","author":"M. Baaz","year":"1996","unstructured":"M. Baaz, A. Leitsch, R. Zach. Incompleteness of an infinite-valued first-order G\u00f6del Logic and of some temporal logic of programs. In: Proceedings of Computer Science Logic CSL\u201995. Berlin, 1996. Springer."},{"key":"14_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/10703163_27","volume-title":"Computer Science Logic, 12th International Workshop, CSL\u201998","author":"M. Baaz","year":"1999","unstructured":"M. Baaz, H. Veith. Quantifier Elimination in Fuzzy Logic. Computer Science Logic, 12th International Workshop, CSL\u201998, LNCS 1584, 1999, 399\u2013414."},{"key":"14_CR10","unstructured":"M. Baaz, H. Veith. An Axiomatization of Quantified Propositional G\u00f6del Logic Using the Takeuti-Titani Rule. Proc. Logic Colloquium 1998, LNML, Springer, to appear."},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s001530050151","volume":"38","author":"M. Baaz","year":"1999","unstructured":"M. Baaz, H. Veith. Interpolation in fuzzy logic. Arch. Math. Logic, 38 (1999), 461\u2013489.","journal-title":"Arch. Math. Logic"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"M. Baaz, R. Zach. Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic. Proc. CSL\u20192000, 2000, 187\u2013201.","DOI":"10.1007\/3-540-44622-2_12"},{"key":"14_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1007\/3-540-58156-1_32","volume-title":"Proc. CADE\u201994","author":"L. Bachmair","year":"1994","unstructured":"L. Bachmair, H. Ganzinger. Ordered Chaining forTotal Orderings. Proc. CADE\u201994, Springer LNCS 814, 1994, 435\u2013450."},{"issue":"6","key":"14_CR14","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1145\/293347.293352","volume":"45","author":"L. Bachmair","year":"1998","unstructured":"L. Bachmair, H. Ganzinger. Ordered Chaining Calculi for First-Order Theories of Transitive Relations. J. ACM 45(6) (1998), 1007\u20131049.","journal-title":"J. ACM"},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"A. Degtyarev, A. Voronkov. Decidability Problems for the Prenex Fragment of Intuitionistic Logic. In Proceedings LICS\u201996. IEEE Press, 503\u2013509. 1996.","DOI":"10.1109\/LICS.1996.561467"},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.2307\/2964753","volume":"24","author":"M. Dummett","year":"1959","unstructured":"M. Dummett. A propositional calculus with denumerable matrix. J. Symbolic Logic, 24(1959), 97\u2013106.","journal-title":"J. Symbolic Logic"},{"key":"14_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1002\/malq.19710170126","volume":"17","author":"J.M. Dunn","year":"1971","unstructured":"J.M. Dunn, R.K. Meyer. Algebraic completeness results for Dummett\u2019s LC and its extensions. Z. Math. Logik Grundlagen Math., 17 (1971), 225\u2013230.","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"14_CR18","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1093\/jigpal\/7.3.319","volume":"7","author":"R. Dyckhoff","year":"1999","unstructured":"R. Dyckhoff. A Deterministic Terminating Sequent Calculus for G\u00f6del-Dummett Logic. Logic Journal of the IGPL, 7(1999), 319\u2013326.","journal-title":"Logic Journal of the IGPL"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"579","DOI":"10.2307\/2272747","volume":"37","author":"D.M. Gabbay","year":"1972","unstructured":"D.M. Gabbay. Decidability of some intuitionistic predicate theories. J. of Symbolic Logic, vol. 37, pp. 579\u2013587. 1972.","journal-title":"J. of Symbolic Logic"},{"key":"14_CR20","doi-asserted-by":"crossref","unstructured":"H. Ganzinger, V. Sofronie-Stokkermans. Chaining Techniques for Automated Theorem Proving in Many-Valued Logics. In: Proceedings 30th IEEE Symposium on Multiple-Valued Logic. IEEE Press, 337\u2013344. 2000.","DOI":"10.1109\/ISMVL.2000.848641"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"P. H\u00e1jek. Metamathematics of Fuzzy Logic. Kluwer, 1998.","DOI":"10.1007\/978-94-011-5300-3"},{"key":"14_CR22","doi-asserted-by":"publisher","first-page":"159","DOI":"10.2307\/2964111","volume":"27","author":"A. Horn","year":"1962","unstructured":"A. Horn. Logic with truth values in a linearly ordered Heyting algebra. J. Symbolic Logic, 27 (1962), 159\u2013170.","journal-title":"J. Symbolic Logic"},{"key":"14_CR23","doi-asserted-by":"crossref","unstructured":"A. Leitsch. The Resolution Calculus. Springer, 1997. Kluwer, 1998.","DOI":"10.1007\/978-3-642-60605-2"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/S0747-7171(86)80028-1","volume":"2","author":"D. Plaisted","year":"1986","unstructured":"D. Plaisted, S. Greenbaum. A Structure-Preserving Clause Form Translation. J. Symbolic Computation 2 (1986), 293\u2013304.","journal-title":"J. Symbolic Computation"},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"264284","DOI":"10.2307\/1969974","volume":"64","author":"H. Rogers","year":"1956","unstructured":"H. Rogers. Certain logical reduction and decision problems. Annals of Mathematics, vol. 64, pp. 264284. 1956.","journal-title":"Annals of Mathematics"},{"key":"14_CR26","doi-asserted-by":"publisher","first-page":"851","DOI":"10.2307\/2274139","volume":"49","author":"G. Takeuti","year":"1984","unstructured":"G. Takeuti, T. Titani. Intuitionistic fuzzy logic and intuitionistic fuzzy set theory. J. Symbolic Logic, 49 (1984), 851\u2013866.","journal-title":"J. Symbolic Logic"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45653-8_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T19:20:22Z","timestamp":1556479222000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45653-8_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540429579","9783540456537"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-45653-8_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}