Skip to main content

Terminating Calculi and Countermodels for Constructive Modal Logics

  • Conference paper
  • First Online:
Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2021)

Abstract

We investigate terminating sequent calculi for constructive modal logics \(\mathsf {CK}\) and \(\mathsf {CCDL}\) in the style of Dyckhoff’s calculi for intuitionistic logic. We first present strictly terminating calculi for these logics. Our calculi provide immediately a decision procedure for the respective logics and have good proof-theoretical properties, namely they allow for a syntactic proof of cut admissibility. We then present refutation calculi for non-provability in both logics. Their main feature is that they support direct countermodel extraction: each refutation directly defines a finite countermodel of the refuted formula in a natural neighbourhood semantics for these logics.

We thank the reviewers for very accurate comments and corrections that helped us to improve the first version of this paper. This work has been partially supported by the ANR-FWF project TICAMORE ANR-16-CE91-0002-01; FWF I 2982. Dalmonte is supported by a Ernst Mach worldwide grant implemented by the OeAD, Austria Agency for Education and Internationalisation, and financed by BMBWF.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Notes

  1. 1.

    Decidability for these logics follows from the finite model property established in Mendler and de Paiva [16] and Dalmonte et al. [3].

  2. 2.

    To be precise, the sets \(\varGamma ^\sigma \) and \(\varDelta ^\sigma \) depend on the refutation \(\mathscr {R}\). In order not to burden the notation we avoid explicit reference to \(\mathscr {R}\) as it is clear from the context.

  3. 3.

    The transformation in [3] must be slightly modified given the alternative formulation of the neighbourhood semantics.

  4. 4.

    As an example, an extraction of relational countermodels from failed proofs in a G4-calculus for Intuitionistic Strong Löb Logic with only \(\Box \) is presented in [9].

References

  1. Arisaka, R., Das, A., Straßburger, L.: On nested sequents for constructive modal logics. Log. Methods Comput. Sci. 11(3), 1–33 (2015)

    MathSciNet  MATH  Google Scholar 

  2. Bellin, G., De Paiva, V., Ritter, E.: Extended Curry-Howard correspondence for a basic constructive modal logic. In: Proceedings of Methods for Modalities, vol. 2 (2001)

    Google Scholar 

  3. Dalmonte, T., Grellois, C., Olivetti, N.: Intuitionistic non-normal modal logics: a general framework. J. Philos. Log. 49(5), 833–882 (2020)

    Article  MathSciNet  Google Scholar 

  4. Dyckhoff, R.: Contraction-free sequent calculi for intuitionistic logic. J. Symb. Log. 57(3), 795–807 (1992)

    Article  MathSciNet  Google Scholar 

  5. Dyckhoff, R., Negri, S.: Admissibility of structural rules for contraction-free systems of intuitionistic logic. J. Symb. Log. 65(4), 1499–1518 (2000)

    Article  MathSciNet  Google Scholar 

  6. Ferrari, M., Fiorentini, C., Fiorino, G.: Contraction-free linear depth sequent calculi for intuitionistic propositional logic with the subformula property and minimal depth counter-models. J. Autom. Reason. 51(2), 129–149 (2013)

    Article  MathSciNet  Google Scholar 

  7. Fischer Servi, G.: Semantics for a class of intuitionistic modal calculi. In: Dalla Chiara, M.L. (ed.) Italian Studies in the Philosophy of Science. BSPS, vol. 47, pp. 59–72. Springer, Dordrecht (1980). https://doi.org/10.1007/978-94-009-8937-5_5

  8. Fitch, F.B.: Intuitionistic modal logic with quantifiers. J. Symb. Log. 14(4), 113–118 (1950)

    Article  Google Scholar 

  9. van der Giessen, I., Iemhoff, R.: Proof theory for intuitionistic strong Löb logic. arXiv preprint arXiv:2011.10383 (2020)

  10. Girlando, M., Straßburger, L.: MOIN: a nested sequent theorem prover for intuitionistic modal logics (system description). In: Peltier, N., Sofronie-Stokkermans, V. (eds.) IJCAR 2020. LNCS (LNAI), vol. 12167, pp. 398–407. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-51054-1_25

    Chapter  Google Scholar 

  11. Goldblatt, R.I.: Grothendieck topology as geometric modality. Math. Log. Q. 27(31–35), 495–529 (1981)

    Article  MathSciNet  Google Scholar 

  12. Goré, R., Postniece, L., Tiu, A.: Cut-elimination and proof search for biintuitionistic tense logic. In: Shehtman, V., Beklemishev, L., Goranko, V. (eds.) Advances in Modal Logic 8, pp. 156–177. College Publications (2010)

    Google Scholar 

  13. Iemhoff, R.: Terminating sequent calculi for two intuitionistic modal logics. J. Log. Comput. 28(7), 1701–1712 (2018)

    Article  MathSciNet  Google Scholar 

  14. Iemhoff, R.: Uniform interpolation and the existence of sequent calculi. Ann. Pure Appl. Log. 170(11), 102711 (2019)

    Google Scholar 

  15. Kojima, K.: Relational and neighborhood semantics for intuitionistic modal logic. Rep. Math. Log. 47, 87–113 (2012)

    MathSciNet  MATH  Google Scholar 

  16. Mendler, M., De Paiva, V.: Constructive CK for contexts. Context Representation and Reasoning (CRR-2005) 13 (2005)

    Google Scholar 

  17. Mendler, M., Scheele, S.: Cut-free Gentzen calculus for multimodal CK. Inf. Comput. 209(12), 1465–1490 (2011)

    Article  MathSciNet  Google Scholar 

  18. Pinto, L., Dyckhoff, R.: Loop-free construction of counter-models for intuitionistic propositional logic. In: Symposia Gaussiana, Conference A, pp. 225–232 (1995)

    Google Scholar 

  19. Plotkin, G., Stirling, C.: A framework for intuitionistic modal logics. In: Proceedings of the 1st Conference on Theoretical Aspects of Reasoning about Knowledge (TARK), pp. 399–406 (1986)

    Google Scholar 

  20. Prawitz, D.: Natural Deduction: A Proof-Theoretical Study. Almqvist & Wiksell (1965)

    Google Scholar 

  21. Simpson, A.K.: The Proof Theory and Semantics of Intuitionistic Modal Logic. PhD thesis, School of Informatics, University of Edinburgh (1994)

    Google Scholar 

  22. Stewart, C., de Paiva, V., Alechina, N.: Intuitionistic modal logic: a 15-year retrospective. J. Log. Comput. 28(5), 873–882 (2018)

    Article  MathSciNet  Google Scholar 

  23. Wijesekera, D.: Constructive modal logics I. Ann. Pure Appl. Log. 50(3), 271–301 (1990)

    Article  MathSciNet  Google Scholar 

  24. Wijesekera, D., Nerode, A.: Tableaux for constructive concurrent dynamic logic. Ann. Pure Appl. Log. 135(1–3), 1–72 (2005)

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tiziano Dalmonte .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2021 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Dalmonte, T., Grellois, C., Olivetti, N. (2021). Terminating Calculi and Countermodels for Constructive Modal Logics. In: Das, A., Negri, S. (eds) Automated Reasoning with Analytic Tableaux and Related Methods. TABLEAUX 2021. Lecture Notes in Computer Science(), vol 12842. Springer, Cham. https://doi.org/10.1007/978-3-030-86059-2_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-86059-2_23

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-86058-5

  • Online ISBN: 978-3-030-86059-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics