{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T12:14:14Z","timestamp":1744200854947,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T00:00:00Z","timestamp":1646611200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T00:00:00Z","timestamp":1646611200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"TU Wien"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Log. Univers."],"published-print":{"date-parts":[[2022,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We introduce a game for (extended) G\u00f6del logic where the players\u2019 interaction stepwise reduces claims about the relative order of truth degrees of complex formulas to atomic truth comparison claims. Using the concept of disjunctive game states this semantic game is lifted to a provability game, where winning strategies correspond to proofs in a sequents-of-relations calculus.<\/jats:p>","DOI":"10.1007\/s11787-022-00300-0","type":"journal-article","created":{"date-parts":[[2022,3,7]],"date-time":"2022-03-07T13:03:16Z","timestamp":1646658196000},"page":"221-235","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["From Truth Degree Comparison Games to Sequents-of-Relations Calculi for G\u00f6del Logic"],"prefix":"10.1007","volume":"16","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2932-5477","authenticated-orcid":false,"given":"Christian","family":"Ferm\u00fcller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Timo","family":"Lang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1877-1167","authenticated-orcid":false,"given":"Alexandra","family":"Pavlova","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,3,7]]},"reference":[{"key":"300_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. Ann. Math. Artif. Intell. 4, 225\u2013248 (1991)","journal-title":"Ann. Math. Artif. Intell."},{"key":"300_CR2","doi-asserted-by":"crossref","unstructured":"Baaz, M.: Infinite-valued G\u00f6del logics with $$0 $$-$$1 $$-projections and relativizations. In: G\u00f6del\u201996: Logical Foundations of Mathematics, Computer Science and Physics\u2014Kurt G\u00f6del\u2019s legacy, Brno, Czech Republic, August 1996, Proceedings, pp. 23\u201333. Association for Symbolic Logic (1996)","DOI":"10.1007\/978-3-662-21963-8_2"},{"key":"300_CR3","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-7908-1769-0_6","volume-title":"Beyond Two: Theory and Applications of Multiple-Valued Logic. Studies in Fuzziness and Soft Computing","author":"M Baaz","year":"2003","unstructured":"Baaz, M., Ciabattoni, A., Ferm\u00fcller, C.: Sequent of relations calculi: a framework for analytic deduction in many-valued logics. In: Fitting, M., Or\u0142owska, E. (eds.) Beyond Two: Theory and Applications of Multiple-Valued Logic. Studies in Fuzziness and Soft Computing, vol. 114, pp. 157\u2013180. Physica-Verlag, Heidelberg (2003)"},{"key":"300_CR4","doi-asserted-by":"crossref","unstructured":"Baaz, M., Ciabattoni, A., Ferm\u00fcller, C.G.: Cut-elimination in a sequents-of-relations calculus for G\u00f6del logic. In: 31st IEEE International Symposium on Multiple-Valued Logic, ISMVL 2001, Warsaw, Poland, May 22\u201324, 2001, Proceedings, pp. 181\u2013186. IEEE Computer Society (2001)","DOI":"10.1109\/ISMVL.2001.924570"},{"issue":"6","key":"300_CR5","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1093\/logcom\/13.6.835","volume":"13","author":"M Baaz","year":"2003","unstructured":"Baaz, M., Ciabattoni, A., Ferm\u00fcller, C.G.: Hypersequent calculi for G\u00f6del logics\u2014a survey. J. Log. Comput. 13(6), 835\u2013861 (2003)","journal-title":"J. Log. Comput."},{"key":"300_CR6","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.) Automated Reasoning with Analytic Tableaux and Related Methods, pp. 36\u201351. Springer, Berlin (1999)"},{"key":"300_CR7","doi-asserted-by":"publisher","first-page":"496","DOI":"10.1007\/978-3-540-32275-7_33","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"A Ciabattoni","year":"2005","unstructured":"Ciabattoni, A., Ferm\u00fcller, C.G., Metcalfe, G.: Uniform rules and dialogue games for fuzzy logics. In: Baader, F., Voronkov, A. (eds.) Logic for Programming, Artificial Intelligence, and Reasoning, pp. 496\u2013510. Springer, Berlin (2005)"},{"issue":"14","key":"300_CR8","doi-asserted-by":"publisher","first-page":"1941","DOI":"10.1016\/j.fss.2009.09.011","volume":"161","author":"A Ciabattoni","year":"2010","unstructured":"Ciabattoni, A., Vetterlein, T.: On the (fuzzy) logical content of CADIAG-2. Fuzzy Sets Syst. 161(14), 1941\u20131958 (2010)","journal-title":"Fuzzy Sets Syst."},{"issue":"2","key":"300_CR9","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. Symb. Log. 24(2), 97\u2013106 (1959)","journal-title":"J. Symb. Log."},{"issue":"1","key":"300_CR10","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s11225-009-9185-2","volume":"92","author":"CG Ferm\u00fcller","year":"2009","unstructured":"Ferm\u00fcller, C.G., Metcalfe, G.: Giles\u2019s game and the proof theory of \u0141ukasiewicz logic. Stud. Log. 92(1), 27\u201361 (2009)","journal-title":"Stud. Log."},{"issue":"4","key":"300_CR11","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/BF02123379","volume":"33","author":"R Giles","year":"1974","unstructured":"Giles, R.: A non-classical logic for physics. Stud. Log. 33(4), 397\u2013415 (1974)","journal-title":"Stud. Log."},{"key":"300_CR12","first-page":"13","volume-title":"Selected Papers on \u0141ukasiewicz Sentential Calculi","author":"Robin Giles","year":"1977","unstructured":"Giles, Robin: A non-classical logic for physics. In: Wojcicki, R., Malinowski, G. (eds.) Selected Papers on \u0141ukasiewicz Sentential Calculi, pp. 13\u201351. Polish Academy of Sciences, Warsaw (1977)"},{"issue":"1","key":"300_CR13","first-page":"344","volume":"55","author":"K G\u00f6del","year":"1990","unstructured":"G\u00f6del, K.: Zum Intuitionistischen Aussagenkalk\u00fcl (1932) (Reprint). J. Symb. Log. 55(1), 344\u2013344 (1990)","journal-title":"J. Symb. Log."},{"key":"300_CR14","volume-title":"Logic, Language-Games and Information: Kantian Themes in the Philosophy of Logic","author":"J Hintikka","year":"1973","unstructured":"Hintikka, J.: Logic, Language-Games and Information: Kantian Themes in the Philosophy of Logic. Clarendon Press, Oxford (1973)"},{"key":"300_CR15","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511981418","volume-title":"Independence-Friendly Logic: A Game-Theoretic Approach","author":"AL Mann","year":"2011","unstructured":"Mann, A.L., Sandu, G., Sevenster, M.: Independence-Friendly Logic: A Game-Theoretic Approach. Cambridge University Press, Cambridge (2011)"},{"issue":"3","key":"300_CR16","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 Trans. Comput. Log. (TOCL) 6(3), 578\u2013613 (2005)","journal-title":"ACM Trans. Comput. Log. (TOCL)"},{"issue":"4","key":"300_CR17","doi-asserted-by":"publisher","first-page":"417","DOI":"10.2178\/bsl\/1203350879","volume":"13","author":"N Segerlind","year":"2007","unstructured":"Segerlind, N.: The complexity of propositional proofs. Bull. Symb. Log. 13(4), 417\u2013481 (2007)","journal-title":"Bull. Symb. Log."},{"key":"300_CR18","series-title":"Cambridge Tracts in Theoretical Computer Science","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139168717","volume-title":"Basic Proof Theory","author":"AS Troelstra","year":"2000","unstructured":"Troelstra, A.S., Schwichtenberg, H.: Basic Proof Theory. Cambridge Tracts in Theoretical Computer Science, 2nd edn. Cambridge University Press, Cambridge (2000)","edition":"2"},{"key":"300_CR19","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9674.001.0001","volume-title":"Logic in Games","author":"J Van Benthem","year":"2014","unstructured":"Van Benthem, J.: Logic in Games. MIT Press, Cambridge (2014)"}],"container-title":["Logica Universalis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11787-022-00300-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11787-022-00300-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11787-022-00300-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,19]],"date-time":"2024-09-19T21:38:03Z","timestamp":1726781883000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11787-022-00300-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,7]]},"references-count":19,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["300"],"URL":"https:\/\/doi.org\/10.1007\/s11787-022-00300-0","relation":{},"ISSN":["1661-8297","1661-8300"],"issn-type":[{"type":"print","value":"1661-8297"},{"type":"electronic","value":"1661-8300"}],"subject":[],"published":{"date-parts":[[2022,3,7]]},"assertion":[{"value":"15 June 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 December 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 March 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}