这是indexloc提供的服务,不要输入任何密码
Skip to main content
Log in

Another Look at Modality and Connexivity

  • Published:
Logica Universalis Aims and scope Submit manuscript

Abstract

In this paper, I introduce a modal logic CS5, an expansion of the non-connexive propositional classical logic with modalities with a tweaked falsification condition, thereby rendered a connexive modal logic. The logic is defined with a hyper-sequent calculus, properly modified from that of classical S5.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Fig. 1
Fig. 2

Similar content being viewed by others

Explore related subjects

Discover the latest articles and news from researchers in related subjects, suggested using machine learning.

Notes

  1. Actually, expansion, since the vocabulary is enriched with modal operators.

  2. This modality was first considered in [5]. This equivalence is known in the literature for a modality with a linear accessibility relation.

  3. In [8], the modalized formula is repeated in the premise, to obtain invertibility of the rules. Since this issue is orthogonal to connexiuvity, I present the simpler version of the rules.

  4. Omitting this provision amounts to taking as the base logic the non-connexive N4 [1, 7] instead of classical propositional logic.

  5. Recall that the original falsity condition fot ‘\(\Box \)’ is

    $$\begin{aligned} {{\mathcal {M}}}, s \models ^{-} \Box \varphi \ \textrm{iff}\ \exists t \in W:\ {{\mathcal {M}}},t \models ^{-} \varphi \end{aligned}$$
  6. Actually, those are axiom schemes. I use ‘axioms’ for brevity.

References

  1. Almukdad, A., Nelson, D.: Constructible falsity and inexact predicates. J. Symb. Log. 49, 231–233 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  2. Estrada-González, L.: The Bochum plan and the foundations of contra-classical logics. CLE, 19(1), (2020)

  3. Estrada-González, L.: Possibility, Consistency, Connexivity. In: Olivetti, Nicola, Verbrugge, Rineke, Negri, Sara, Sandu, Gabriel (eds.) 13th Conference on Advances in Modal Logic. AiML 2020, Helsinki, Finland, pp. 189–207. College Publications, London (2020)

  4. Francez, N.: A view of Connexive Logics. College Publications, London (2021)

    MATH  Google Scholar 

  5. Francez, N.: Negation-cohesive connectives: a generalization of connexivity. Logic Journal of the IGPL special issue on connexive logics, edited by Luis Estrada-González and Fernando Cano-Jorge, (2024)

  6. Kamide, N., Wansing, H.: Connexive modal logic based on positive S4. In Jean-Yves Béziau and Marcelo Conigli, editors, Logic without Frontiers, pages 389–409. College Publications, King’s College, London, (2011). Festschrift for Walter Alexandre Carnielli on the Occasion of His 60th Birthday

  7. Nelson, D.: Constructible falsity. J. Symb. Log. 14, 16–26 (1949)

    Article  MathSciNet  MATH  Google Scholar 

  8. Poggiolesi, F.: A cut-free simple sequent calculus for modal logic S5. Rev. Symbol. Logic 1(1), 3–15 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  9. Wansing, H.: Connexive modal logic. In Renate Schmidt, Ian Pratt-Hartmann, Mark Reynolds, and Heinrich Wansing, editors, Advances in modal logic, volume 5, pages 367–383. College Publications, King’s College, London, (2005)

  10. Wansing, H.: Connexive logic. In Edward N. Zalta, editor, The Stanford Encyclopedia of Philosophy. Summer 2022 edition, (2022). https://plato.stanford.edu/archives/spr2020/entries/logic-connexive/

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Nissim Francez.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Apendix

Apendix

The characteristic axiomsFootnote 6 of connexive logics (see [4] and [10] for a general survey) are:

Aristotle’s axioms:.:

For every \(\varphi \):

$$\begin{aligned} & A_{1}:\ {\vdash }\ \lnot (\varphi {\rightarrow }\lnot \varphi ) \end{aligned}$$
(5.21)
$$\begin{aligned} & A_{2}:\ {\vdash }\ \lnot (\lnot \varphi {\rightarrow }\varphi ) \end{aligned}$$
(5.22)
Boethius’ axioms:.:

For every \(\varphi \) and \(\psi \):

$$\begin{aligned} & B_{1}:\ {\vdash }\ (\varphi {\rightarrow }\psi ) {\rightarrow }\lnot (\varphi {\rightarrow }\lnot \psi ) \end{aligned}$$
(5.23)
$$\begin{aligned} & B_{2}:\ {\vdash }\ (\varphi {\rightarrow }\lnot \psi ) {\rightarrow }\lnot (\varphi {\rightarrow }\ \psi ) \end{aligned}$$
(5.24)

Also a negative characteristic is added, a non-derivability, to the effect that

$$\begin{aligned} (asym)\ \ {\nvdash }\ (\varphi {\rightarrow }\psi ) {\rightarrow }(\psi {\rightarrow }\varphi ) \end{aligned}$$
(5.25)

The condition (asym) is known as the asymmetry of the conditional, and is imposed to prevent interpreting the conditional as a biconditional.

Those axioms are not classical logic validities, rendering connexive logics as contra-classical. They have a strong intuitive appeal, reflecting properties of a “natural” conditional, closer to some uses of the indicative conditional in natural language.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Francez, N. Another Look at Modality and Connexivity. Log. Univers. 19, 131–139 (2025). https://doi.org/10.1007/s11787-025-00372-8

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11787-025-00372-8

Keywords

Mathematics Subject Classification