{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T21:39:22Z","timestamp":1772573962477,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540730989","type":"print"},{"value":"9783540730996","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73099-6_5","type":"book-chapter","created":{"date-parts":[[2007,9,14]],"date-time":"2007-09-14T07:04:02Z","timestamp":1189753442000},"page":"28-42","source":"Crossref","is-referenced-by-count":2,"title":["Proof Theory for First Order \u0141ukasiewicz Logic"],"prefix":"10.1007","author":[{"given":"Matthias","family":"Baaz","sequence":"first","affiliation":[]},{"given":"George","family":"Metcalfe","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"5_CR1","doi-asserted-by":"publisher","first-page":"939","DOI":"10.2307\/2273828","volume":"52","author":"A. Avron","year":"1987","unstructured":"Avron, A.: A constructive analysis of RM. Journal of Symbolic Logic\u00a052(4), 939\u2013951 (1987)","journal-title":"Journal of Symbolic Logic"},{"key":"5_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45653-8_14","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"M. Baaz","year":"2001","unstructured":"Baaz, M., Ciabattoni, A., Ferm\u00fcller, C.G.: Herbrand\u2019s theorem for Prenex G\u00f6del logic and its consequences for theorem proving. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, Springer, Heidelberg (2001)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44622-2_12","volume-title":"Computer Science Logic","author":"M. Baaz","year":"2000","unstructured":"Baaz, M., Zach, R.: Hypersequents and the proof theory of intuitionistic fuzzy logic. In: Clote, P.G., Schwichtenberg, H. (eds.) CSL 2000. LNCS, vol.\u00a01862, Springer, Heidelberg (2000)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"69","DOI":"10.2307\/2270410","volume":"29","author":"L.P. Belluce","year":"1964","unstructured":"Belluce, L.P.: Further results on infinite valued predicate logic. Journal of Symbolic Logic\u00a029, 69\u201378 (1964)","journal-title":"Journal of Symbolic Logic"},{"key":"5_CR5","doi-asserted-by":"publisher","first-page":"43","DOI":"10.2307\/2271335","volume":"28","author":"L.P. Belluce","year":"1963","unstructured":"Belluce, L.P., Chang, C.C.: A weak completeness theorem for infinite valued first order logic. Journal of Symbolic Logic\u00a028, 43\u201350 (1963)","journal-title":"Journal of Symbolic Logic"},{"key":"5_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"A. Ciabattoni","year":"2003","unstructured":"Ciabattoni, A., Metcalfe, G.: Bounded \u0141ukasiewicz logics. In: Mayer, M.C., Pirri, F. (eds.) TABLEAUX 2003. LNCS, vol.\u00a02796, Springer, Heidelberg (2003)"},{"key":"5_CR7","volume-title":"Algebraic Foundations of Many-Valued Reasoning. Trends in Logic","author":"R. Cignoli","year":"1999","unstructured":"Cignoli, R., D\u2019Ottaviano, I.M.L., Mundici, D.: Algebraic Foundations of Many-Valued Reasoning. Trends in Logic, vol.\u00a07. Kluwer, Dordrecht (1999)"},{"key":"5_CR8","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)"},{"issue":"2\u20134","key":"5_CR9","first-page":"161","volume":"23","author":"P. H\u00e1jek","year":"2006","unstructured":"H\u00e1jek, P.: Making fuzzy description logic more general. Fuzzy Sets and Systems\u00a023(2\u20134), 161\u2013178 (2006)","journal-title":"Fuzzy Sets and Systems"},{"issue":"1","key":"5_CR10","doi-asserted-by":"publisher","first-page":"77","DOI":"10.2307\/2271339","volume":"28","author":"L.S. Hay","year":"1963","unstructured":"Hay, L.S.: Axiomatization of the infinite-valued predicate calculus. Journal of Symbolic Logic\u00a028(1), 77\u201386 (1963)","journal-title":"Journal of Symbolic Logic"},{"key":"5_CR11","unstructured":"\u0141ukasiewicz, J.: Selected Writings. North-Holland, Edited by L. Borowski (1970)"},{"key":"5_CR12","unstructured":"\u0141ukasiewicz, J., Tarski, A.: Untersuchungen \u00fcber den Aussagenkalk\u00fcl. Comptes Rendus des S\u00e9ances de la Societ\u00e9 des Sciences et des Lettres de Varsovie, Classe III, 23, Reprinted and translated in (1930)"},{"key":"5_CR13","series-title":"Oxford Logic Guides","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198537878.001.0001","volume-title":"Many-Valued Logics","author":"G. Malinowski","year":"1993","unstructured":"Malinowski, G.: Many-Valued Logics. Oxford Logic Guides, vol.\u00a025. Oxford University Press, New York (1993)"},{"issue":"1","key":"5_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2268660","volume":"16","author":"R. McNaughton","year":"1951","unstructured":"McNaughton, R.: A theorem about infinite-valued sentential logic. Journal of Symbolic Logic\u00a016(1), 1\u201313 (1951)","journal-title":"Journal of Symbolic Logic"},{"issue":"3","key":"5_CR15","doi-asserted-by":"publisher","first-page":"578","DOI":"10.1145\/1071596.1071600","volume":"6","author":"G. Metcalfe","year":"2005","unstructured":"Metcalfe, G., Olivetti, N., Gabbay, D.: Sequent and hypersequent calculi for abelian and \u0141ukasiewicz logics. ACM Transactions on Computational Logic\u00a06(3), 578\u2013613 (2005)","journal-title":"ACM Transactions on Computational Logic"},{"key":"5_CR16","doi-asserted-by":"crossref","first-page":"165","DOI":"10.4064\/fm-50-2-165-190","volume":"50","author":"A. Mostowski","year":"1961","unstructured":"Mostowski, A.: Axiomatizability of some many valued predicate calculi. Fundamentica Mathematica\u00a050, 165\u2013190 (1961)","journal-title":"Fundamentica Mathematica"},{"key":"5_CR17","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0022-1236(86)90015-7","volume":"65","author":"D. Mundici","year":"1986","unstructured":"Mundici, D.: Interpretation of AF C*-algebras in \u0141ukasiewicz sentential calculus. Journal of Functional Analysis\u00a065, 15\u201363 (1986)","journal-title":"Journal of Functional Analysis"},{"issue":"1-2","key":"5_CR18","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0304-3975(87)90083-1","volume":"52","author":"D. Mundici","year":"1987","unstructured":"Mundici, D.: Satisfiability in many-valued sentential logic is NP-complete. Theoretical Computer Science\u00a052(1-2), 145\u2013153 (1987)","journal-title":"Theoretical Computer Science"},{"key":"5_CR19","first-page":"57","volume":"4","author":"V. Novak","year":"1996","unstructured":"Novak, V.: On the Hilbert-Ackermann theorem in fuzzy logic. Acta. Mathematica et Informatica Universitatis Ostraviensis\u00a04, 57\u201374 (1996)","journal-title":"Acta. Mathematica et Informatica Universitatis Ostraviensis"},{"key":"5_CR20","unstructured":"Ragaz, M.E.: Arithmetische Klassifikation von Formelmengen der unendlichwertigen Logik. PhD thesis, ETH Z\u00fcrich (1981)"},{"key":"5_CR21","unstructured":"Rutledge, J.D.: A preliminary investigation of the infinitely many-valued predicate calculus. PhD thesis, Cornell University, Ithaca (1959)"},{"issue":"2","key":"5_CR22","doi-asserted-by":"publisher","first-page":"159","DOI":"10.2307\/2964111","volume":"27","author":"B. Scarpellini","year":"1962","unstructured":"Scarpellini, B.: Die Nichtaxiomatisierbarkeit des unendlichwertigen Pr\u00e4dikatenkalk\u00fcls von \u0141ukasiewicz. Journal of Symbolic Logic\u00a027(2), 159\u2013170 (1962)","journal-title":"Journal of Symbolic Logic"},{"key":"5_CR23","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1613\/jair.813","volume":"14","author":"U. Straccia","year":"2001","unstructured":"Straccia, U.: Reasoning within fuzzy description logics. Journal of Artificial Intelligence Research\u00a014, 137\u2013166 (2001)","journal-title":"Journal of Artificial Intelligence Research"},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/S0165-0114(01)00106-3","volume":"124","author":"P. Vojt\u00e1s","year":"2001","unstructured":"Vojt\u00e1s, P.: Fuzzy logic programming. Fuzzy Sets. and Systems\u00a0124, 361\u2013370 (2001)","journal-title":"Fuzzy Sets. and Systems"}],"container-title":["Lecture Notes in Computer Science","Automated Reasoning with Analytic Tableaux and Related Methods"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73099-6_5.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T22:06:26Z","timestamp":1708207586000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73099-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540730989","9783540730996"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73099-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[]}}