{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,24]],"date-time":"2025-11-24T09:57:18Z","timestamp":1763978238312},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T00:00:00Z","timestamp":1623888000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T00:00:00Z","timestamp":1623888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Log. Univers."],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s11787-021-00280-7","type":"journal-article","created":{"date-parts":[[2021,6,17]],"date-time":"2021-06-17T22:02:16Z","timestamp":1623967336000},"page":"85-103","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An Unexpected Boolean Connective"],"prefix":"10.1007","volume":"16","author":[{"given":"S\u00e9rgio","family":"Marcelino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,6,17]]},"reference":[{"key":"280_CR1","doi-asserted-by":"crossref","unstructured":"Anantharaman, S., Narendran, P., Rusinowitch M.: Closure properties and decision problems of dag automata. Inf. Process. Lett. 94(5), 231\u2013240 (2005)","DOI":"10.1016\/j.ipl.2005.02.004"},{"issue":"1","key":"280_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. Logica Universalis 1(1), 41\u201370 (2007)","journal-title":"Logica Universalis"},{"issue":"2","key":"280_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s11225-009-9175-4","volume":"91","author":"A Avron","year":"2009","unstructured":"Avron, A., Konikowska, B.: Proof systems for reasoning about computation errors. Stud. Logica 91(2), 273\u2013293 (2009)","journal-title":"Stud. Logica"},{"issue":"3","key":"280_CR4","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. Logic Comput. 15(3), 241\u2013261 (2005)","journal-title":"J. Logic Comput."},{"key":"280_CR5","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-94-007-0479-4_4","volume-title":"Handbook of Philosophical Logic","author":"A Avron","year":"2011","unstructured":"Avron, A., Zamansky, A.: Non-deterministic semantics for logical systems. In: Gabbay, D., Guenthner, F. (eds.) Handbook of Philosophical Logic, vol. 16, pp. 227\u2013304. Springer, Berlin (2011)"},{"issue":"4","key":"280_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10817-013-9273-x","volume":"51","author":"M Baaz","year":"2013","unstructured":"Baaz, M., Lahav, O., Zamansky, A.: Finite-valued semantics for canonical labelled calculi. J. Autom. Reason. 51(4), 401\u2013430 (2013)","journal-title":"J. Autom. Reason."},{"issue":"18","key":"280_CR7","doi-asserted-by":"publisher","first-page":"1071","DOI":"10.1016\/j.ipl.2009.06.015","volume":"109","author":"O Beyersdorff","year":"2009","unstructured":"Beyersdorff, O., Meier, A., Vollmer, M.: The complexity of propositional implication. Inf. Process. Lett. 109(18), 1071\u20131077 (2009)","journal-title":"Inf. Process. Lett."},{"key":"280_CR8","doi-asserted-by":"publisher","unstructured":"Blasio, C., Caleiro, C., Marcos, J.: What is a logical theory? On theories containing assertions and denials. Synthese. https:\/\/doi.org\/10.1007\/s11229-019-02183-z (2019)","DOI":"10.1007\/s11229-019-02183-z"},{"key":"280_CR9","first-page":"1","volume":"60","author":"S Bonzio","year":"2020","unstructured":"Bonzio, S., Moraschini, T., Baldi, M.: Logics of left variable inclusion and p\u0142onka sums of matrices. Arch. Math. Logic 60, 1\u201328 (2020)","journal-title":"Arch. Math. Logic"},{"key":"280_CR10","doi-asserted-by":"crossref","unstructured":"Caleiro, C., Marcelino, S.: Analytic calculi for monadic PNmatrices. In: Logic, Language, Information, and Computation (WoLLIC 2019), volume 11541 of LNCS, pp. 84\u201398. Springer, (2019)","DOI":"10.1007\/978-3-662-59533-6_6"},{"key":"280_CR11","unstructured":"Caleiro, C., Marcelino, S.: On axioms and rexpansions. In: Outstanding Contributions to Logic - Arnon Avron on Semantics and Proof Theory of Non-Classical Logics. Springer, in print"},{"key":"280_CR12","doi-asserted-by":"crossref","unstructured":"Caleiro, C., Marcelino, S., Filipe, P.: Infectious semantics and analytic calculi for even more inclusion logics. In: IEEE 50th International Symposium on Multiple-Valued Logic (ISMVL), pp. 224\u2013229 (2020)","DOI":"10.1109\/ISMVL49045.2020.000-1"},{"issue":"7","key":"280_CR13","doi-asserted-by":"publisher","first-page":"2213","DOI":"10.1007\/s00500-018-3584-0","volume":"23","author":"C Caleiro","year":"2019","unstructured":"Caleiro, C., Marcelino, S., Marcos, J.: Combining fragments of classical logic: when are interaction principles needed? Soft Comput. 23(7), 2213\u20132231 (2019)","journal-title":"Soft Comput."},{"key":"280_CR14","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.fss.2017.10.014","volume":"345","author":"C Caleiro","year":"2018","unstructured":"Caleiro, C., Marcelino, S., Rivieccio, U.: Characterizing finite-valuedness. Fuzzy Sets Syst. 345, 113\u2013125 (2018)","journal-title":"Fuzzy Sets Syst."},{"issue":"1","key":"280_CR15","first-page":"5:1","volume":"16","author":"A Ciabattoni","year":"2014","unstructured":"Ciabattoni, A., Lahav, O., Spendier, L., Zamansky, A.: Taming paraconsistent (and Other) logics: an algorithmic approach. ACM Trans. Comput. Logic 16(1), 5:1\u20135:23 (2014)","journal-title":"ACM Trans. Comput. Logic"},{"key":"280_CR16","unstructured":"Comon, H., Dauchet, M., Gilleron, R., L\u00f6ding, C., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications. http:\/\/tata.gforge.inria.fr\/ (2007)"},{"issue":"7","key":"280_CR17","doi-asserted-by":"publisher","first-page":"2243","DOI":"10.1007\/s00500-018-03707-4","volume":"23","author":"M Coniglio","year":"2019","unstructured":"Coniglio, M., Golzio, A.: Swap structures semantics for Ivlev-like modal logics. Soft Comput. 23(7), 2243\u20132254 (2019)","journal-title":"Soft Comput."},{"key":"280_CR18","volume-title":"Abstract Algebraic Logic - An Introductory Textbook","author":"J Font","year":"2016","unstructured":"Font, J.: Abstract Algebraic Logic - An Introductory Textbook. College Publications, London (2016)"},{"key":"280_CR19","doi-asserted-by":"crossref","unstructured":"Gabbay, D.: Fibring Logics, volume\u00a038 of Oxford Logic Guides. Clarendon Press, (1999)","DOI":"10.1093\/oso\/9780198503811.001.0001"},{"key":"280_CR20","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/9055.001.0001","volume-title":"The Connectives","author":"L Humberstone","year":"2011","unstructured":"Humberstone, L.: The Connectives. MIT Press, Cambridge (2011)"},{"issue":"2","key":"280_CR21","doi-asserted-by":"publisher","first-page":"156","DOI":"10.3390\/e22020156","volume":"22","author":"J Jorge","year":"2020","unstructured":"Jorge, J., Holik, F.: Non-deterministic semantics for quantum states. Entropy 22(2), 156 (2020)","journal-title":"Entropy"},{"key":"280_CR22","doi-asserted-by":"crossref","unstructured":"Marcelino, S., Caleiro, C.: Disjoint fibring of non-deterministic matrices. In: Logic, Language, Information, and Computation (WoLLIC 2017), pp. 242\u2013255, (2017)","DOI":"10.1007\/978-3-662-55386-2_17"},{"key":"280_CR23","doi-asserted-by":"publisher","unstructured":"Marcelino, S., Caleiro, C.: Axiomatizing non-deterministic many-valued generalized consequence relations. Synthese. https:\/\/doi.org\/10.1007\/s11229-019-02142-8 (2019)","DOI":"10.1007\/s11229-019-02142-8"},{"key":"280_CR24","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1023\/B:STUD.0000032104.14199.08","volume":"76","author":"S Odintsov","year":"2004","unstructured":"Odintsov, S.: lOn the representation of N4-lattices. Stud. Logica 76, 385\u2013405 (2004)","journal-title":"Stud. Logica"},{"key":"280_CR25","volume-title":"On The Two-Valued Iterative Systems of Mathematical Logic","author":"E Post","year":"1941","unstructured":"Post, E.: On The Two-Valued Iterative Systems of Mathematical Logic. Princeton University Press, Princeton (1941)"},{"issue":"3","key":"280_CR26","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1093\/jigpal\/jzx005","volume":"25","author":"J Rasga","year":"2017","unstructured":"Rasga, J., Sernadas, C., Mateus, P., Sernadas, A.: Decision and optimization problems in the unreliable-circuit logic. Logic J. IGPL 25(3), 283\u2013308 (2017)","journal-title":"Logic J. IGPL"},{"issue":"4","key":"280_CR27","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF00401653","volume":"40","author":"W Rautenberg","year":"1981","unstructured":"Rautenberg, W.: 2-element matrices. Stud. Logica 40(4), 315\u2013353 (1981)","journal-title":"Stud. Logica"},{"issue":"1","key":"280_CR28","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1016\/j.indag.2017.09.011","volume":"29","author":"D Rinaldia","year":"2018","unstructured":"Rinaldia, D., Schustera, P., Wesse, D.: Eliminating disjunctions by disjunction elimination. Indag. Math. 29(1), 226\u2013259 (2018)","journal-title":"Indag. Math."},{"key":"280_CR29","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s00012-014-0272-5","volume":"71","author":"U Rivieccio","year":"2014","unstructured":"Rivieccio, U.: Implicative twist-structures. Algebra Universalis 71, 155\u2013186 (2014)","journal-title":"Algebra Universalis"},{"key":"280_CR30","doi-asserted-by":"crossref","unstructured":"Scott, D.: Completeness and axiomatizability in many-valued logic. In: Proceedings of the Tarski Symposium, volume XXV of Proceedings of Symposia in Pure Mathematics, pp. 411\u2013435. American Mathematical Society (1974)","DOI":"10.1090\/pspum\/025\/0363802"},{"issue":"5","key":"280_CR31","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1093\/logcom\/ext038","volume":"24","author":"A Sernadas","year":"2014","unstructured":"Sernadas, A., Rasga, J., Sernadas, C., Mateus, P.: Approximate reasoning about logic circuits with single-fan-out unreliable gates. J. Logic Comput. 24(5), 1023\u20131069 (2014)","journal-title":"J. Logic Comput."},{"issue":"2","key":"280_CR32","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1093\/logcom\/9.2.149","volume":"9","author":"A Sernadas","year":"1999","unstructured":"Sernadas, A., Sernadas, C., Caleiro, C.: Fibring of logics as a categorial construction. J Logic Comput. 9(2), 149\u2013179 (1999)","journal-title":"J Logic Comput."},{"issue":"6","key":"280_CR33","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1093\/logcom\/exr035","volume":"22","author":"A Sernadas","year":"2011","unstructured":"Sernadas, A., Sernadas, C., Rasga, J.: On meet-combination of logics. J. Logic Comput. 22(6), 1453\u20131470 (2011)","journal-title":"J. Logic Comput."},{"key":"280_CR34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511565687","volume-title":"Multiple-Conclusion Logic","author":"D Shoesmith","year":"1978","unstructured":"Shoesmith, D., Smiley, T.: Multiple-Conclusion Logic. Cambridge University Press, Cambridge (1978)"},{"key":"280_CR35","series-title":"Synthese Library","volume-title":"Theory of Logical Calculi","author":"R W\u00f3jcicki","year":"1998","unstructured":"W\u00f3jcicki, R.: Theory of Logical Calculi. Synthese Library. Kluwer, Dordrecht (1998)"},{"key":"280_CR36","first-page":"67","volume":"3","author":"A Wro\u0144ski","year":"1974","unstructured":"Wro\u0144ski, A.: On the cardinality of matrices strongly adequate for the intuitionistic propositional logic. Reports Math. Logic 3, 67\u201372 (1974)","journal-title":"Reports Math. Logic"}],"container-title":["Logica Universalis"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11787-021-00280-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11787-021-00280-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11787-021-00280-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,5]],"date-time":"2023-11-05T01:44:09Z","timestamp":1699148649000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11787-021-00280-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6,17]]},"references-count":36,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["280"],"URL":"https:\/\/doi.org\/10.1007\/s11787-021-00280-7","relation":{},"ISSN":["1661-8297","1661-8300"],"issn-type":[{"value":"1661-8297","type":"print"},{"value":"1661-8300","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,6,17]]},"assertion":[{"value":"20 September 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 May 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}