{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,7]],"date-time":"2025-12-07T16:02:33Z","timestamp":1765123353562,"version":"3.37.3"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T00:00:00Z","timestamp":1685923200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T00:00:00Z","timestamp":1685923200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["390727645"],"award-info":[{"award-number":["390727645"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stud Logica"],"published-print":{"date-parts":[[2024,4]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper studies proof systems for the logics of super-strict implication <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{ST2}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>ST<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>\u2013<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{ST5}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>ST<\/mml:mi>\n                    <mml:mn>5<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, which correspond to C.I. Lewis\u2019 systems <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{S2}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>S<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>\u2013<jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{S5}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>S<\/mml:mi>\n                    <mml:mn>5<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> freed of paradoxes of strict implication. First, Hilbert-style axiomatic systems are introduced and shown to be sound and complete by simulating <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{STn}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>STn<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{Sn}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>Sn<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> and backsimulating <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{Sn}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>Sn<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> in <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{STn}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mi>STn<\/mml:mi>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>, respectively (for <jats:inline-formula><jats:alternatives><jats:tex-math>$${\\textsf{n}} =2, \\ldots , 5$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>n<\/mml:mi>\n                    <mml:mo>=<\/mml:mo>\n                    <mml:mn>2<\/mml:mn>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mo>\u2026<\/mml:mo>\n                    <mml:mo>,<\/mml:mo>\n                    <mml:mn>5<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>). Next, <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{G3}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>G<\/mml:mi>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-style labelled sequent calculi are investigated. It is shown that these calculi have the good structural properties that are distinctive of <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\textsf{G3}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>G<\/mml:mi>\n                    <mml:mn>3<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>-style calculi, that they are sound and complete, and it is shown that the proof search for <jats:inline-formula><jats:alternatives><jats:tex-math>$$\\mathsf {G3.ST2}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mrow>\n                    <mml:mi>G<\/mml:mi>\n                    <mml:mn>3<\/mml:mn>\n                    <mml:mo>.<\/mml:mo>\n                    <mml:mi>ST<\/mml:mi>\n                    <mml:mn>2<\/mml:mn>\n                  <\/mml:mrow>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula> is terminating and therefore the logic is decidable.<\/jats:p>","DOI":"10.1007\/s11225-023-10048-3","type":"journal-article","created":{"date-parts":[[2023,6,5]],"date-time":"2023-06-05T14:03:00Z","timestamp":1685973780000},"page":"249-294","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Proof Systems for Super- Strict Implication"],"prefix":"10.1007","volume":"112","author":[{"given":"Guido","family":"Gherardi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4021-8667","authenticated-orcid":false,"given":"Eugenio","family":"Orlandelli","sequence":"additional","affiliation":[]},{"given":"Eric","family":"Raidl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,5]]},"reference":[{"unstructured":"Anderson, A.R., and N. Belnap, Entailment. The Logic of Relevance and Necessity vol. 1. Princeton University Press, Princeton, 1975.","key":"10048_CR1"},{"key":"10048_CR2","volume-title":"A New Introduction to Modal Logic","author":"M Cresswell","year":"1996","unstructured":"Cresswell, M., and G.H. Hughes, A New Introduction to Modal Logic, Routledge, London, 1996."},{"key":"10048_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/s10670-020-00332-2","author":"V Crupi","year":"2020","unstructured":"Crupi, V., and A. Iacona, The evidential conditional, Erkenntnishttps:\/\/doi.org\/10.1007\/s10670-020-00332-2, 2020.","journal-title":"Erkenntnis"},{"doi-asserted-by":"publisher","unstructured":"Gherardi, G., and E. Orlandelli, Super-strict implications, Bulletin of the Section of Logic 50(1):1\u201334. https:\/\/doi.org\/10.18778\/0138-0680.2021.02, 2021.","key":"10048_CR4","DOI":"10.18778\/0138-0680.2021.02"},{"doi-asserted-by":"publisher","unstructured":"Gherardi, G., and E. Orlandelli, Non-normal super-strict implications, in A. Indrzejczak, and M. Zawidzki, (eds.), Proceedings of the 10th International Conference on Non-Classical Logics. Theory and Applications, EPTCS, Sydney, https:\/\/doi.org\/10.4204\/EPTCS.358.1, 2022, pp. 1\u201311.","key":"10048_CR5","DOI":"10.4204\/EPTCS.358.1"},{"key":"10048_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12136-019-00396-y","volume":"35","author":"G Gomes","year":"2020","unstructured":"Gomes, G., Concessive conditionals without Even if and nonconcessive conditionals with Even if, Acta Analytica 35:1\u201321, 2020.","journal-title":"Acta Analytica"},{"issue":"1","key":"10048_CR7","doi-asserted-by":"publisher","first-page":"55","DOI":"10.5840\/logos-episteme20221313","volume":"13","author":"M G\u00fcnther","year":"2022","unstructured":"G\u00fcnther, M., A connexive conditional, Logos & Episteme 13(1):55\u201363, 2022.","journal-title":"A connexive conditional. Logos & Episteme"},{"doi-asserted-by":"crossref","unstructured":"Kripke, S.A., Semantical analysis of modal logic II. Non-normal modal propositional calculi, in J.W. Addison, A. Tarski, and L. Henkin, (eds.), The Theory of Models: Proceedings of the 1963 International Symposium at Berkeley, North Holland, Amsterdam, 1965, pp. 206\u2013220.","key":"10048_CR8","DOI":"10.1016\/B978-0-7204-2233-7.50026-5"},{"issue":"2","key":"10048_CR9","doi-asserted-by":"publisher","first-page":"176","DOI":"10.2307\/2964179","volume":"22","author":"EJ Lemmon","year":"1957","unstructured":"Lemmon, E.J., New foundations for Lewis modal systems, The Journal of Symbolic Logic 22(2):176\u2013186, 1957.","journal-title":"The Journal of Symbolic Logic"},{"key":"10048_CR10","first-page":"127","volume-title":"The Logica Yearbook 2020","author":"W Lenzen","year":"2020","unstructured":"Lenzen, W., The third and fourth stoic accounts of conditionals, in M. Blicha and I. Sedl\u00e1r, (eds.), The Logica Yearbook 2020, College Publications, Rickmansworth, 2020, pp. 127\u2013146."},{"key":"10048_CR11","volume-title":"Symbolic Logic","author":"CI Lewis","year":"1932","unstructured":"Lewis, C.I., and C.H. Langford, Symbolic Logic, Century Co, New York, 1932."},{"key":"10048_CR12","volume-title":"Counterfactuals","author":"D Lewis","year":"1973","unstructured":"Lewis, D., Counterfactuals, Harvard University Press, Cambridge, MA, 1973."},{"key":"10048_CR13","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/s10992-005-2267-3","volume":"34","author":"S Negri","year":"2005","unstructured":"Negri, S., Proof analysis in modal logic, Journal of Philosophical Logic 34:507\u2013544, https:\/\/doi.org\/10.1007\/s10992-005-2267-3, 2005.","journal-title":"Journal of Philosophical Logic"},{"key":"10048_CR14","first-page":"239","volume-title":"Dag Prawitz on Proofs and Meaning","author":"S Negri","year":"2001","unstructured":"Negri, S., and J. von Plato, Meaning in use, in H. Wansing, (ed.), Dag Prawitz on Proofs and Meaning, Springer, Cham, 2001, pp. 239\u201357."},{"key":"10048_CR15","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1093\/mind\/XXXIX.156.440","volume":"39","author":"EJ Nelson","year":"1930","unstructured":"Nelson, E.J., Intensional relation, Mind 39: 440\u2013453, https:\/\/doi.org\/10.1093\/mind\/XXXIX.156.440, 1930.","journal-title":"Mind"},{"doi-asserted-by":"publisher","unstructured":"Odintsov, S., D., Skurt, and H. Wansing, Connexive variants of modal logics over FDE, in O. Arieli, and A. Zamansky, (eds.), Arnon Avron on Semantics and Proof Theory of Non-Classical Logics. Outstanding Contributions to Logic, Springer, Cham, https:\/\/doi.org\/10.1007\/978-3-030-71258-7_13, 2021, pp. 295\u2013318.","key":"10048_CR16","DOI":"10.1007\/978-3-030-71258-7_13"},{"issue":"1","key":"10048_CR17","first-page":"125","volume":"13","author":"M Ohnishi","year":"1961","unstructured":"Ohnishi, M., Gentzen decision procedures for Lewis\u2019s systems $$S2$$ and $$S3$$, Osaka Mathematical Journal 13(1):125\u2013137 1961.","journal-title":"Osaka Mathematical Journal"},{"doi-asserted-by":"publisher","unstructured":"Ohnishi, M., von Wright-Anderson\u2019s decision procedures for Lewis\u2019s systems $$S2$$ and $$S3$$, Osaka Mathematical Journal 13(1):139\u2013142, https:\/\/doi.org\/10.18910\/9565, 1961.","key":"10048_CR18","DOI":"10.18910\/9565"},{"key":"10048_CR19","first-page":"625","volume-title":"Advances in Modal Logic 2022","author":"E Orlandelli","year":"2022","unstructured":"Orlandelli, E., and M. Tesi, Labelled sequent calculi for logics of strict implication, in D.F. Duque, and A. Palmigiano, (eds.), Advances in Modal Logic 2022, College Publications, London, 2022, pp. 625\u2013642."},{"key":"10048_CR20","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1023\/A:1004230028063","volume":"26","author":"C Pizzi","year":"1997","unstructured":"Pizzi, C., and T. Williamson, Strong Boethius\u2019 thesis and consequential implication, Journal of Philosophical Logic 26:569\u2013588, https:\/\/doi.org\/10.1023\/A:1004230028063 1997.","journal-title":"Journal of Philosophical Logic"},{"key":"10048_CR21","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1023\/A:1006294205280","volume":"18","author":"G Priest","year":"1999","unstructured":"Priest, G., Negation as cancellation, and connexive logic, Topoi 18:14\u2013148, https:\/\/doi.org\/10.1023\/A:1006294205280, 1999.","journal-title":"Topoi"},{"issue":"4","key":"10048_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S1755020318000199","volume":"12","author":"E Raidl","year":"2019","unstructured":"Raidl, E., Completeness for counter-doxa conditionals: using ranking semantics, The Review of Symbolic Logic 12(4):1\u201331, https:\/\/doi.org\/10.1017\/S1755020318000199, 2019.","journal-title":"The Review of Symbolic Logic"},{"doi-asserted-by":"publisher","unstructured":"Raidl, E., Strengthened conditionals, in B. Liao, and Y. W\u00e1ng, (eds.), Context, Conflict and Reasoning. Logic in Asia: Studia Logica Library Springer, Singapore, https:\/\/doi.org\/10.1007\/978-981-15-7134-3_11, 2020, pp. 139\u2013155.","key":"10048_CR23","DOI":"10.1007\/978-981-15-7134-3_11"},{"issue":"1","key":"10048_CR24","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/s11245-020-09704-3","volume":"40","author":"E Raidl","year":"2021","unstructured":"Raidl, E., Definable conditionals, Topoi 40(1):87\u2013105, https:\/\/doi.org\/10.1007\/s11245-020-09704-3, 2021.","journal-title":"Topoi"},{"key":"10048_CR25","first-page":"201","volume-title":"The Logica Yearbook 2020","author":"E Raidl","year":"2021","unstructured":"Raidl, E., Three conditionals: contraposition, difference-making and dependency, in: M. Blicha, and I. Sedlar, (eds.) The Logica Yearbook 2020, College Publications, London, 2021, pp. 201\u2013217."},{"doi-asserted-by":"publisher","unstructured":"Raidl, E., Neutralization, Lewis\u2019 doctored conditional, or another note on \u201cA connexive conditional\u201d, Logos & Episteme 14(1) 2023. 2023, pp. 101\u2013118, https:\/\/doi.org\/10.5840\/logosepisteme20231415","key":"10048_CR26","DOI":"10.5840\/logosepisteme20231415"},{"doi-asserted-by":"crossref","unstructured":"Raidl, E., and G. Gomes, The implicative conditional, Journal of Philosophical Logic, 1\u201336 2022, forthcoming.","key":"10048_CR27","DOI":"10.1007\/s10992-023-09715-6"},{"doi-asserted-by":"publisher","unstructured":"Raidl, E., A. Iacona, and V. Crupi, The logic of the evidential conditional, The Review of Symbolic Logic, 1\u201313, https:\/\/doi.org\/10.1017\/S1755020321000071, 2021.","key":"10048_CR28","DOI":"10.1017\/S1755020321000071"},{"unstructured":"Routley, R., V. Plumwood, R.K. Meyer, and R.T. Brady, Relevant Logics and Their Rivals, Ridgeview, Atascardero, CA, 1982.","key":"10048_CR29"},{"key":"10048_CR30","first-page":"98","volume-title":"Studies in Logical Theory","author":"RC Stalnaker","year":"1968","unstructured":"Stalnaker, R.C., A theory of conditionals, in N. Rescher, (ed.), Studies in Logical Theory, Basil Blackwell, Hoboken, 1968, pp. 98\u2013112."},{"issue":"4","key":"10048_CR31","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s11225-020-09924-z","volume":"109","author":"M Tesi","year":"2021","unstructured":"Tesi, M., Labelled sequent calculi for Lewis\u2019 non-normal propositional modal logics. Studia Logica 109(4):725\u2013757, https:\/\/doi.org\/10.1007\/s11225-020-09924-z, 2021.","journal-title":"Studia Logica"},{"unstructured":"von Fintel, K., The presupposition of subjunctive conditionals, in U. Sauerland, and O. Percus, (eds.), The Interpretive Tract: MIT Working Papers in Linguistics 25:29\u201344, 1998.","key":"10048_CR32"},{"doi-asserted-by":"crossref","unstructured":"von Fintel, K., Counterfactuals in a Dynamic Context, in Kenstowicz, M., (ed.), Ken Hale: A Life in Language, MIT Press, Cambridge, MA, 2001, pp. 123\u2013152.","key":"10048_CR33","DOI":"10.7551\/mitpress\/4056.003.0006"},{"doi-asserted-by":"crossref","unstructured":"Wansing, H., and H. Omori, A note on \u201ca connexive conditional\u201d, Logos & Episteme XIII(3):325\u2013328, 2022.","key":"10048_CR34","DOI":"10.5840\/logos-episteme202213326"}],"container-title":["Studia Logica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-023-10048-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11225-023-10048-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11225-023-10048-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,4]],"date-time":"2024-04-04T08:15:21Z","timestamp":1712218521000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11225-023-10048-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,5]]},"references-count":34,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,4]]}},"alternative-id":["10048"],"URL":"https:\/\/doi.org\/10.1007\/s11225-023-10048-3","relation":{},"ISSN":["0039-3215","1572-8730"],"issn-type":[{"type":"print","value":"0039-3215"},{"type":"electronic","value":"1572-8730"}],"subject":[],"published":{"date-parts":[[2023,6,5]]},"assertion":[{"value":"18 March 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 June 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}