{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T10:10:01Z","timestamp":1775038201203,"version":"3.50.1"},"publisher-location":"Cham","reference-count":58,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031384981","type":"print"},{"value":"9783031384998","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,9,2]],"date-time":"2023-09-02T00:00:00Z","timestamp":1693612800000},"content-version":"vor","delay-in-days":244,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We present a uniform characterisation of three-valued logics by means of bisequent calculus (BSC). It is a generalised form of sequent calculus (SC) where rules operate on the ordered pairs of ordinary sequents. BSC may be treated as the weakest kind of system in the rich family of generalised SC operating on items being some collections of ordinary sequents. This family covers several forms of hypersequent and nested sequent calculi introduced to provide decent SC for several non-classical logics. It seems that for many non-classical logics, including some many-valued, paraconsistent and modal logics, this reasonably modest generalization of standard SC is sufficient. In this paper we examine a variety of three-valued logics and show how they can be formalised in the framework of bisequent calculus. All provided systems are cut-free and satisfy the subformula property. Also the interpolation theorem is constructively proved for some logics.<\/jats:p>","DOI":"10.1007\/978-3-031-38499-8_19","type":"book-chapter","created":{"date-parts":[[2023,9,1]],"date-time":"2023-09-01T23:03:25Z","timestamp":1693609405000},"page":"325-343","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["A Uniform Formalisation of\u00a0Three-Valued Logics in\u00a0Bisequent Calculus"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4063-1651","authenticated-orcid":false,"given":"Andrzej","family":"Indrzejczak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7731-1339","authenticated-orcid":false,"given":"Yaroslav","family":"Petrukhin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,2]]},"reference":[{"key":"19_CR1","unstructured":"Anderson, A.R., Belnap, N.D.: Entailment. The Logic of Relevance and Necessity, vol. 1. Princeton University Press (1975)"},{"issue":"1","key":"19_CR2","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1305\/ndjfl\/1093958482","volume":"7","author":"FG Asenjo","year":"1966","unstructured":"Asenjo, F.G.: A calculus of antinomie. Notre Dame J. Formal Logic 7(1), 103\u2013105 (1966)","journal-title":"Notre Dame J. Formal Logic"},{"issue":"1","key":"19_CR3","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1305\/ndjfl\/1093891610","volume":"16","author":"FG Asenjo","year":"1975","unstructured":"Asenjo, F.G., Tamburino, J.: Logic of antinomies. Notre Dame J. Formal Logic 16(1), 17\u201344 (1975)","journal-title":"Notre Dame J. Formal Logic"},{"issue":"1","key":"19_CR4","doi-asserted-by":"publisher","first-page":"276","DOI":"10.2307\/2274919","volume":"61","author":"A Avron","year":"1991","unstructured":"Avron, A.: Natural 3-valued logics \u2013 characterization and proof theory. J. Symb. Logic 61(1), 276\u2013294 (1991)","journal-title":"J. Symb. Logic"},{"issue":"2","key":"19_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1305\/ndjfl\/1093636612","volume":"27","author":"A Avron","year":"1986","unstructured":"Avron, A.: On an implicational connective of RM. Notre Dame J. Formal Logic 27(2), 201\u2013209 (1986)","journal-title":"Notre Dame J. Formal Logic"},{"issue":"1","key":"19_CR6","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. Univers. 1(1), 41\u201370 (2007)","journal-title":"Log. Univers."},{"issue":"90\u201391","key":"19_CR7","first-page":"195","volume":"23","author":"D Batens","year":"1980","unstructured":"Batens, D.: Paraconsistent extensional propositional logics. Logique et Anal. (N.S.) 23(90\u201391), 195\u2013234 (1980)","journal-title":"Logique et Anal. (N.S.)"},{"issue":"6","key":"19_CR8","first-page":"333","volume":"29","author":"M Baaz","year":"1994","unstructured":"Baaz, M., Ferm\u00fcller, C.G., Zach, R.: Elimination of cuts in first-order finite-valued logics. J. Inf. Process. Cybern. 29(6), 333\u2013355 (1994)","journal-title":"J. Inf. Process. Cybern."},{"key":"19_CR9","doi-asserted-by":"crossref","unstructured":"Bochvar, D.A.: On a three-valued logical calculus and its application to the analysis of the paradoxes of the classical extended functional calculus (English translation of Bochvar\u2019s paper of 1938). Hist. Philos. Logic 2(1\u20132), 87\u2013112 (1981)","DOI":"10.1080\/01445348108837023"},{"key":"19_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-662-59533-6_6","volume-title":"Logic, Language, Information, and Computation","author":"C Caleiro","year":"2019","unstructured":"Caleiro, C., Marcelino, S.: Analytic calculi for monadic PNmatrices. In: Iemhoff, R., Moortgat, M., de Queiroz, R. (eds.) WoLLIC 2019. LNCS, vol. 11541, pp. 84\u201398. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-662-59533-6_6"},{"issue":"1","key":"19_CR11","first-page":"59","volume":"8","author":"WA Carnielli","year":"1991","unstructured":"Carnielli, W.A.: On sequents and tableaux for many-valued logics. J. Non-Classical Logic 8(1), 59\u201376 (1991)","journal-title":"J. Non-Classical Logic"},{"key":"19_CR12","doi-asserted-by":"crossref","unstructured":"Carnielli, W.A., Marcos, J.: Taxonomy of C-systems. In: Carnielli, W.A., Coniglio, M.E., D\u2019Ottaviano, I.M.L. (eds.) Paraconsistency: The Logical Way to the Inconsistent, pp. 1\u201394. CRC Press (2002)","DOI":"10.1201\/9780203910139.pt1"},{"key":"19_CR13","unstructured":"D\u2019Ottaviano, I.M.L., da Costa, N.C.A.: Sur un probl\u00e9me de Ja\u015bkowski. Comptes Rendus Acad. Sci. Paris 270A, 1349\u20131353 (1970)"},{"issue":"4","key":"19_CR14","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1305\/ndjfl\/1093891487","volume":"15","author":"NCA da Costa","year":"1974","unstructured":"da Costa, N.C.A.: On the theory of inconsistent formal systems. Notre Dame J. Formal Logic 15(4), 497\u2013510 (1974)","journal-title":"Notre Dame J. Formal Logic"},{"key":"19_CR15","unstructured":"Doherty, P.: A constraint-based approach to proof-procedures for multi-valued logics. In: Proceedings of the 1st World Conference on Fundamentals of Artificial Intelligence (WOCFAI). Springer (1991)"},{"issue":"1","key":"19_CR16","first-page":"113","volume":"20","author":"M Fitting","year":"1994","unstructured":"Fitting, M.: Kleene\u2019s three valued logics and their children. Fund. Inform. 20(1), 113\u2013131 (1994)","journal-title":"Fund. Inform."},{"key":"19_CR17","first-page":"65","volume":"69","author":"K G\u00f6del","year":"1932","unstructured":"G\u00f6del, K.: Zum intuitionistischen Aussgenkalk\u00fcl. Anz. Akad. Wiss. Wien. 69, 65\u201366 (1932)","journal-title":"Anz. Akad. Wiss. Wien."},{"key":"19_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"38","DOI":"10.1007\/978-3-030-86059-2_3","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"L Gr\u00e4tz","year":"2021","unstructured":"Gr\u00e4tz, L.: Analytic tableaux for non-deterministic semantics. In: Das, A., Negri, S. (eds.) TABLEAUX 2021. LNCS (LNAI), vol. 12842, pp. 38\u201355. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86059-2_3"},{"key":"19_CR19","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198539896.001.0001","volume-title":"Automated Deduction in Multiple-Valued Logics","author":"R H\u00e4hnle","year":"1994","unstructured":"H\u00e4hnle, R.: Automated Deduction in Multiple-Valued Logics. Oxford University Press, Oxford (1994)"},{"key":"19_CR20","doi-asserted-by":"crossref","unstructured":"H\u00e4hnle, R.: Tableaux and related methods. In: Robinson, A., Voronkov, A. (eds.) Handbook of Automated Reasoning, pp. 101\u2013177. Elsevier (2001)","DOI":"10.1016\/B978-044450813-3\/50005-9"},{"key":"19_CR21","unstructured":"Halld\u00e9n, S.: The logic of nonsense. Lundequista Bokhandeln (1949)"},{"key":"19_CR22","unstructured":"Heyting, A.: Die Formalen Regeln der intuitionistischen Logik. Sitzungsber. Preussischen Acad. Wiss. Berlin 42\u201346 (1930)"},{"key":"19_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-030-29007-8_16","volume-title":"Frontiers of Combining Systems","author":"A Indrzejczak","year":"2019","unstructured":"Indrzejczak, A.: Two is enough \u2013 bisequent calculus for S5. In: Herzig, A., Popescu, A. (eds.) FroCoS 2019. LNCS (LNAI), vol. 11715, pp. 277\u2013294. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-29007-8_16"},{"issue":"4","key":"19_CR24","first-page":"505","volume":"29","author":"A Indrzejczak","year":"2020","unstructured":"Indrzejczak, A.: Free definite description theory - sequent calculi and cut elimination. Logic Log. Philos. 29(4), 505\u2013539 (2020)","journal-title":"Logic Log. Philos."},{"key":"19_CR25","doi-asserted-by":"crossref","unstructured":"Indrzejczak, A.: Sequents and Trees. An Introduction to the Theory and Applications of Propositional Sequent Calculi. Birkh\u00e4user (2021)","DOI":"10.1007\/978-3-030-57145-0"},{"issue":"2","key":"19_CR26","doi-asserted-by":"publisher","first-page":"624","DOI":"10.1017\/S1755020321000289","volume":"16","author":"A Indrzejczak","year":"2023","unstructured":"Indrzejczak, A.: Russellian definite description theory\u2013a proof-theoretic approach. Rev. Symb. Logic 16(2), 624\u2013649 (2023)","journal-title":"Rev. Symb. Logic"},{"key":"19_CR27","unstructured":"Indrzejczak, A.: Bisequent calculus for four-valued quasi-relevant logics; cut elimination and interpolation. J. Autom. Reason, submitted"},{"key":"19_CR28","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-030-86059-2_4","volume-title":"Automated Reasoning with Analytic Tableaux and Related Methods","author":"A Indrzejczak","year":"2021","unstructured":"Indrzejczak, A., Zawidzki, M.: Tableaux for free logics with descriptions. In: Das, A., Negri, S. (eds.) TABLEAUX 2021. LNCS (LNAI), vol. 12842, pp. 56\u201373. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-86059-2_4"},{"key":"19_CR29","first-page":"58","volume":"6","author":"S Ja\u015bkowski","year":"1936","unstructured":"Ja\u015bkowski, S.: Recherches sur le syst\u00e8me de la logique intuitioniste. Actes Congr. Int. phil. sci. 6, 58\u201361 (1936)","journal-title":"Actes Congr. Int. phil. sci."},{"key":"19_CR30","doi-asserted-by":"crossref","unstructured":"Ja\u015bkowski, S.: Rachunek zda\u0144 dla system\u00f3w dedukcyjnych sprzecznych. Studia Societatis Scientiarum Torunensis, Sectio A I(5), 57\u201377 (1948). English translation: A propositional calculus for inconsistent deductive systems. Logic Logical Philos. 7, 35\u201356 (1999)","DOI":"10.12775\/LLP.1999.003"},{"issue":"1","key":"19_CR31","doi-asserted-by":"publisher","first-page":"150","DOI":"10.2307\/2267778","volume":"3","author":"SC Kleene","year":"1938","unstructured":"Kleene, S.C.: On a notation for ordinal numbers. J. Symb. Logic 3(1), 150\u2013155 (1938)","journal-title":"J. Symb. Logic"},{"key":"19_CR32","first-page":"116","volume":"15","author":"EY Komendantskaya","year":"2009","unstructured":"Komendantskaya, E.Y.: Functional expressibility of regular Kleene\u2019s logics. Logical Invest. 15, 116\u2013128 (2009). (in Russian)","journal-title":"Logical Invest."},{"issue":"3","key":"19_CR33","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/BF01048484","volume":"23","author":"S Lehmann","year":"1994","unstructured":"Lehmann, S.: Strict Fregean free logic. J. Philos. Log. 23(3), 307\u2013336 (1994)","journal-title":"J. Philos. Log."},{"key":"19_CR34","unstructured":"\u0141ukasiewicz, J.: On three-valued logic (English translation of \u0141ukasiewicz\u2019s paper of 1920). In: Borkowski, L. (ed.) Jan \u0141ukasiewicz: Selected Works, pp. 87\u201388. North-Holland Publishing Company (1970)"},{"key":"19_CR35","unstructured":"Marcos, J.: On a problem of da Costa. In: Sica, G. (ed.) Essays of the Foundations of Mathematics and Logic, vol. 2, pp. 53\u201369. Polimetrica (2005)"},{"key":"19_CR36","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0049-237X(08)72018-4","volume":"35","author":"J McCarty","year":"1963","unstructured":"McCarty, J.: A basis for a mathematical theory of computation. Stud. Logic Found. Math. 35, 33\u201370 (1963)","journal-title":"Stud. Logic Found. Math."},{"key":"19_CR37","volume-title":"Proof Theory for Fuzzy Logics","author":"G Metcalfe","year":"2008","unstructured":"Metcalfe, G., Olivetti, N., Gabbay, D.: Proof Theory for Fuzzy Logics. Springer, Cham (2008)"},{"key":"19_CR38","doi-asserted-by":"crossref","unstructured":"Osorio, M., Carballido, J.L.: Brief study of $${\\bf G_3^\\prime }$$ logic. J. Appl. Non-Classical Logic 18(4), 475\u2013499 (2008)","DOI":"10.3166\/jancl.18.475-499"},{"issue":"4","key":"19_CR39","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s11225-019-09876-z","volume":"108","author":"F Paoli","year":"2020","unstructured":"Paoli, F., Pra Baldi, M.: Proof theory of paraconsistent weak Kleene logic. Stud. Logica 108(4), 779\u2013802 (2020)","journal-title":"Stud. Logica"},{"issue":"1\u20132","key":"19_CR40","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/s11787-018-0190-y","volume":"12","author":"Y Petrukhin","year":"2018","unstructured":"Petrukhin, Y.: Natural deduction for Post\u2019s logics and their duals. Log. Univers. 12(1\u20132), 83\u2013100 (2018)","journal-title":"Log. Univers."},{"key":"19_CR41","doi-asserted-by":"publisher","first-page":"163","DOI":"10.2307\/2370324","volume":"43","author":"E Post","year":"1921","unstructured":"Post, E.: Introduction to a general theory of elementary propositions. Am. J. Math. 43, 163\u2013185 (1921)","journal-title":"Am. J. Math."},{"issue":"1","key":"19_CR42","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/BF00258428","volume":"8","author":"G Priest","year":"1979","unstructured":"Priest, G.: The logic of paradox. J. Philos. Log. 8(1), 219\u2013241 (1979)","journal-title":"J. Philos. Log."},{"key":"19_CR43","volume-title":"Many-Valued Logic","author":"N Rescher","year":"1969","unstructured":"Rescher, N.: Many-Valued Logic. McGraw Hill, New York (1969)"},{"issue":"3","key":"19_CR44","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0020-0255(89)90003-0","volume":"47","author":"L Rozonoer","year":"1989","unstructured":"Rozonoer, L.: On interpretation of inconsistent theories. Inf. Sci. 47(3), 243\u2013266 (1989)","journal-title":"Inf. Sci."},{"key":"19_CR45","doi-asserted-by":"crossref","unstructured":"Rousseau, G.: Sequents in many valued logic. Fundamenta Mathematicae LX(1), 22\u201323 (1967)","DOI":"10.4064\/fm-60-1-23-33"},{"issue":"1","key":"19_CR46","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/BF01053037","volume":"55","author":"AM Sette","year":"1995","unstructured":"Sette, A.M., Carnieli, W.A.: Maximal weakly-intuitionistic logics. Stud. Logica 55(1), 181\u2013203 (1995)","journal-title":"Stud. Logica"},{"issue":"3","key":"19_CR47","first-page":"173","volume":"18","author":"AM Sette","year":"1973","unstructured":"Sette, A.M.: On propositional calculus P$$ _{1} $$. Mathematica Japonica 18(3), 173\u2013180 (1973)","journal-title":"Mathematica Japonica"},{"key":"19_CR48","doi-asserted-by":"crossref","unstructured":"S\u0142upecki, J.: Proof of axiomatizability of full many-valued systems of calculus of propositions. Stud. Logica 29, 155\u2013168 (1971). [English translation of the paper from 1939]","DOI":"10.1007\/BF02121872"},{"issue":"1","key":"19_CR49","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02123418","volume":"21","author":"E S\u0142upecki","year":"1967","unstructured":"S\u0142upecki, E., Bryll, J., Prucnal, T.: Some remarks on the three-valued logic of J. \u0141ukasiewicz. Stud. Logica 21(1), 45\u201370 (1967)","journal-title":"Stud. Logica"},{"key":"19_CR50","unstructured":"Soboci\u0144ski, B.: Axiomatization of certain many-valued systems of the theory of deduction. Roczniki Prac Naukowych Zrzeszenia Asystent\u00f3w Uniwersytetu J\u00f3zefa Pi\u0142sudskiego w Warszawie 1, 399\u2013419 (1936)"},{"key":"19_CR51","first-page":"23","volume":"1","author":"B Soboci\u0144ski","year":"1952","unstructured":"Soboci\u0144ski, B.: Axiomatization of a partial system of three-valued calculus of propositions. J. Comput. Syst. 1, 23\u201355 (1952)","journal-title":"J. Comput. Syst."},{"key":"19_CR52","unstructured":"Stenlund, S.: The logic of description and existence. Filosofiska Studier 18. Uppsala (1973)"},{"key":"19_CR53","first-page":"37","volume":"2","author":"W Sucho\u0144","year":"1974","unstructured":"Sucho\u0144, W.: La methode de Smullyan de construire le calcul n-valent de \u0141ukasiewicz avec implication and negation. Rep. Math. Logic 2, 37\u201342 (1974)","journal-title":"Rep. Math. Logic"},{"issue":"4","key":"19_CR54","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/BF02120672","volume":"36","author":"R Suszko","year":"1977","unstructured":"Suszko, R.: The Fregean axiom and Polish mathematical logic in the 1920\u2019s. Stud. Logica 36(4), 373\u2013380 (1977)","journal-title":"Stud. Logica"},{"key":"19_CR55","first-page":"49","volume":"2","author":"SJ Surma","year":"1974","unstructured":"Surma, S.J.: A method of the construction of finite \u0141ukasiewiczian algebras and its application to a Gentzen-style characterisation of finite logics. Rep. Math. Logic 2, 49\u201354 (1974)","journal-title":"Rep. Math. Logic"},{"issue":"231","key":"19_CR56","first-page":"95","volume":"9","author":"M Takahashi","year":"1967","unstructured":"Takahashi, M.: Many-valued logics of extended Gentzen style I. Sci. Rep. Tokyo Kyoiku Daigaku 9(231), 95\u2013116 (1967)","journal-title":"Sci. Rep. Tokyo Kyoiku Daigaku"},{"key":"19_CR57","first-page":"173","volume":"47","author":"NE Tomova","year":"2012","unstructured":"Tomova, N.E.: A lattice of implicative extensions of regular Kleene\u2019s logics. Rep. Math. Logic 47, 173\u2013182 (2012)","journal-title":"Rep. Math. Logic"},{"issue":"6","key":"19_CR58","doi-asserted-by":"publisher","first-page":"1319","DOI":"10.1007\/s11225-017-9720-5","volume":"105","author":"S Wintein","year":"2017","unstructured":"Wintein, S., Muskens, R.: Interpolation methods for Dunn logics and their extensions. Stud. Logica 105(6), 1319\u20131347 (2017). https:\/\/doi.org\/10.1007\/s11225-017-9720-5","journal-title":"Stud. Logica"}],"container-title":["Lecture Notes in Computer Science","Automated Deduction \u2013 CADE 29"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-38499-8_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,20]],"date-time":"2023-12-20T21:38:41Z","timestamp":1703108321000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-38499-8_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031384981","9783031384998"],"references-count":58,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-38499-8_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"2 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CADE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Automated Deduction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rome","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cade2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/easyconferences.eu\/cade2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"77","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}