{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T17:37:59Z","timestamp":1782927479981,"version":"3.54.5"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T00:00:00Z","timestamp":1602806400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T00:00:00Z","timestamp":1602806400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"University of Gdansk"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Log. Univers."],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The main goal of this paper is to provide an abstract framework for constructing proof systems for various many-valued logics. Using the framework it is possible to generate strongly complete proof systems with respect to any finitely valued deterministic and non-deterministic logic. I provide a couple of examples of proof systems for well-known many-valued logics and prove the completeness of proof systems generated by the framework.<\/jats:p>","DOI":"10.1007\/s11787-020-00263-0","type":"journal-article","created":{"date-parts":[[2020,10,16]],"date-time":"2020-10-16T17:02:35Z","timestamp":1602867755000},"page":"407-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Tree-Like Proof Systems for Finitely-Many Valued Non-deterministic Consequence Relations"],"prefix":"10.1007","volume":"14","author":[{"given":"Pawel","family":"Pawlowski","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,10,16]]},"reference":[{"key":"263_CR1","volume-title":"Handbook of Philosophical Logic","author":"Z Avron","year":"2011","unstructured":"Avron, Z.: Non-deterministic semantics for logical systems. In: Gabbay, D.M., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 16. Springer, Amsterdam (2011)"},{"issue":"1","key":"263_CR2","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/s11787-006-0003-6","volume":"1","author":"A Avron","year":"2007","unstructured":"Avron, A., Ben-Naim, J., Konikowska, B.: Cut-free ordinary sequent calculi for logics having generalized finite-valued semantics. Log. Univ. 1(1), 41\u201370 (2007)","journal-title":"Log. Univ."},{"issue":"4","key":"263_CR3","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1093\/jigpal\/jzi030","volume":"13","author":"A Avron","year":"2005","unstructured":"Avron, A., Konikowska, B.: Multi-valued calculi for logics based on non-determinism. Log. J. IGPL 13(4), 365\u2013387 (2005)","journal-title":"Log. J. IGPL"},{"key":"263_CR4","doi-asserted-by":"crossref","unstructured":"Avron, A., Lev, I.: Canonical propositional Gentzen-type systems. In: Automated Reasoning: First International Joint Conference, IJCAR 2001 Siena, Italy, June 18\u201323, 2001 Proceedings (Lecture Notes in Computer Science), pp. 529\u2013544. Springer, Berlin (2001)","DOI":"10.1007\/3-540-45744-5_45"},{"issue":"3","key":"263_CR5","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1093\/logcom\/exi001","volume":"15","author":"A Avron","year":"2005","unstructured":"Avron, A., Lev, I.: Non-deterministic multiple-valued structures. J. Log. Comput. 15(3), 241\u2013261 (2005)","journal-title":"J. Log. Comput."},{"key":"263_CR6","doi-asserted-by":"crossref","unstructured":"Baaz, M., Ferm\u00fcller, C.G., Salzer, G., Zach, R.: Multlog 1.0: towards an expert system for many-valued logics. In: International Conference on Automated Deduction, pp. 226\u2013230. Springer, Berlin (1996)","DOI":"10.1007\/3-540-61511-3_84"},{"issue":"15\u201318","key":"263_CR7","first-page":"5l","volume":"27","author":"D Batens","year":"1998","unstructured":"Batens, D.: A dynamic semantics for inconsistency-adaptive logics. Bull. Sect. Log. 27(15\u201318), 5l (1998)","journal-title":"Bull. Sect. Log."},{"key":"263_CR8","unstructured":"Batens, D.: Inconsistency-adaptive logics. In: Logic at Work. Essays Dedicated to the Memory of Helena Rasiowa, pp. 445\u2013472. Springer, Berlin (1999)"},{"key":"263_CR9","unstructured":"Batens, D.: A survey of inconsistency-adaptive logics. In: Frontiers of Paraconsistent Logic, pp. 49\u201373. Research Studies Press (2000)"},{"key":"263_CR10","unstructured":"Batens, D., De Clercq, K.: A rich paraconsistent extension of full positive logic. Log. Anal. 185\u2013188 (2004)"},{"key":"263_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801129","volume-title":"An Introduction to Many-Valued and Fuzzy Logic: Semantics, Algebras, and Derivation Systems","author":"M Bergmann","year":"2008","unstructured":"Bergmann, M.: An Introduction to Many-Valued and Fuzzy Logic: Semantics, Algebras, and Derivation Systems. Cambridge University Press, Cambridge (2008)"},{"issue":"2","key":"263_CR12","first-page":"287","volume":"4","author":"DA Bochvar","year":"1939","unstructured":"Bochvar, D.A.: On a three valued calculus and its application to the analysis of contradictories. Mat. Sb. 4(2), 287\u2013308 (1939)","journal-title":"Mat. Sb."},{"key":"263_CR13","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1016\/j.tcs.2015.05.015","volume":"606","author":"W Carnielli","year":"2015","unstructured":"Carnielli, W., Matulovic, M.: The method of polynomial ring calculus and its potentialities. Theor. Comput. Sci. 606, 42\u201356 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"263_CR14","doi-asserted-by":"publisher","first-page":"473","DOI":"10.2307\/2274395","volume":"52","author":"WA Carnielli","year":"1987","unstructured":"Carnielli, W.A.: Systematization of finite many-valued logics through the method of tableaux. J. Symb. Log. 52(2), 473\u2013493 (1987)","journal-title":"J. Symb. Log."},{"key":"263_CR15","doi-asserted-by":"crossref","unstructured":"Coniglio, M.E., Fari\u00f1as del Cerro, L., Peron, N.M.: Finite non-deterministic semantics for some modal systems. J. Appl. Non-Class. Log. 25(1), 20\u201345 (2015)","DOI":"10.1080\/11663081.2015.1011543"},{"issue":"3\u20134","key":"263_CR16","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s11787-014-0106-4","volume":"8","author":"ME Coniglio","year":"2014","unstructured":"Coniglio, M.E., Peron, N.M.: Dugundji\u2019s theorem revisited. Log. Univ. 8(3\u20134), 407\u2013422 (2014)","journal-title":"Log. Univ."},{"issue":"4","key":"263_CR17","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1305\/ndjfl\/1093888132","volume":"18","author":"NCA da Costa","year":"1977","unstructured":"da Costa, N.C.A., Alves, E.H.: A semantical analysis of the calculi $${ c}_n$$. Notre Dame J. Form. Log. 18(4), 621\u2013630 (1977)","journal-title":"Notre Dame J. Form. Log."},{"key":"263_CR18","unstructured":"Fitting, M.: A Semantics for the Logic of Proofs. Technical report, CUNY Ph.D. Program in Computer Science, TR-2003012 (2003)"},{"key":"263_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921049","volume-title":"Axiomatic Theories of Truth","author":"V Halbach","year":"2011","unstructured":"Halbach, V.: Axiomatic Theories of Truth. Cambridge University Press, Cambridge (2011)"},{"key":"263_CR20","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9780262015868.001.0001","volume-title":"The Tarskian Turn. Deflationism and Axiomatic Truth","author":"L Horsten","year":"2011","unstructured":"Horsten, L.: The Tarskian Turn. Deflationism and Axiomatic Truth. MIT Press, Cambridge (2011)"},{"issue":"3\/4","key":"263_CR21","first-page":"114","volume":"17","author":"YV Ivlev","year":"1988","unstructured":"Ivlev, Y.V.: A semantics for modal calculi. Bull. Sect. Log. 17(3\/4), 114\u2013121 (1988)","journal-title":"Bull. Sect. Log."},{"issue":"1","key":"263_CR22","doi-asserted-by":"publisher","first-page":"77","DOI":"10.2307\/2273259","volume":"46","author":"JT Kearns","year":"1981","unstructured":"Kearns, J.T.: Modal semantics without possible worlds. J. Symb. Log. 46(1), 77\u201386 (1981)","journal-title":"J. Symb. Log."},{"issue":"19","key":"263_CR23","doi-asserted-by":"publisher","first-page":"690","DOI":"10.2307\/2024634","volume":"72","author":"SA Kripke","year":"1975","unstructured":"Kripke, S.A.: Outline of a theory of truth. J. Philos. 72(19), 690\u2013716 (1975)","journal-title":"J. Philos."},{"issue":"5","key":"263_CR24","first-page":"815","volume":"3","author":"Skurt Omori","year":"2016","unstructured":"Omori, Skurt: More modal semantics without possible worlds. IfCoLog J. Log. Appl. 3(5), 815\u2013845 (2016)","journal-title":"IfCoLog J. Log. Appl."},{"issue":"1","key":"263_CR25","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1093\/jigpal\/jzx055","volume":"26","author":"P Pawlowski","year":"2018","unstructured":"Pawlowski, P.: Proof systems for BAT consequence relations. Log. J. IGPL 26(1), 96\u2013108 (2018)","journal-title":"Log. J. IGPL"},{"issue":"2","key":"263_CR26","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1017\/S1755020317000363","volume":"11","author":"P Pawlowski","year":"2018","unstructured":"Pawlowski, P., Urbaniak, R.: Many-valued logic of informal provability: a non-deterministic strategy. Rev. Symb. Log. 11(2), 207\u2013223 (2018)","journal-title":"Rev. Symb. Log."},{"key":"263_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511801174","volume-title":"An Introduction to Non-classical Logic","author":"G Priest","year":"2008","unstructured":"Priest, G.: An Introduction to Non-classical Logic, 2nd edn. Cambridge University Press, Cambridge (2008)","edition":"2"},{"key":"263_CR28","unstructured":"Quine, W.V.: The Roots of Reference. Lasalle, Ill., Open Court (1974)"},{"issue":"1","key":"263_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2307\/2963674","volume":"27","author":"N Rescher","year":"1962","unstructured":"Rescher, N.: Quasi-truth-functional systems of propositional logic. J. Symb. Log. 27(1), 1\u201310 (1962)","journal-title":"J. Symb. Log."}],"container-title":["Logica Universalis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11787-020-00263-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11787-020-00263-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11787-020-00263-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,16]],"date-time":"2021-10-16T04:15:12Z","timestamp":1634357712000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11787-020-00263-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,16]]},"references-count":29,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["263"],"URL":"https:\/\/doi.org\/10.1007\/s11787-020-00263-0","relation":{},"ISSN":["1661-8297","1661-8300"],"issn-type":[{"value":"1661-8297","type":"print"},{"value":"1661-8300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,16]]},"assertion":[{"value":"14 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 October 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}