Skip to main content
Log in

Cut-Free Tableau Calculi for some Intuitionistic Modal Logics

  • Published:
Studia Logica Aims and scope Submit manuscript

Abstract

In this paper we provide cut-free tableau calculi for the intuitionistic modal logics IK, ID, IT, i.e. the intuitionistic analogues of the classical modal systems K, D and T. Further, we analyse the necessity of duplicating formulas to which rules are applied. In order to develop these calculi we extend to the modal case some ideas presented by Miglioli, Moscato and Ornaghi for intuitionistic logic. Specifically, we enlarge the language with the new signs Fc and CR near to the usual signs T and F. In this work we establish the soundness and completeness theorems for these calculi with respect to the Kripke semantics proposed by Fischer Servi.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Amati and F. Pirri, 1994, A uniform tableau method for intuitionistic modal logics I*, Studia Logica, 53(1):29–60.

    Google Scholar 

  2. M.J. Cresswell and G.E. Hughes, 1984, A Companion to Modal Logic, Methuen.

  3. G. Fischer Servi, 1981, Completeness for non normal intuitionistic modal logics, Note di Matematica, 1:203–212.

    Google Scholar 

  4. G. Fischer Servi, 1984, Axiomatizations for some intuitionistic modal logics, Rend. Sem. Mat. Univers. Polit. Torino, 42:179–194.

    Google Scholar 

  5. M. Fitting, 1983, Proof Methods for Modal and Intuitionistic Logics, Reidel, Dordrecht.

    Google Scholar 

  6. D.M. Gabbay, 1981, Semantical Investigations in Heyting's Intuitionistic Logic, Reidel, Dordrecht.

    Google Scholar 

  7. P. Miglioli, U. Moscato, and M. Ornaghi, 1994, How to avoid duplications in refutation systems for intuitionistic logic and Kuroda logic, In K. Broda, M. D'Agostino, R. Goré, R. Johnson, and S. Reeves, editors, Theorem Proving with Analytic Tableaux and Related Methods: 3rd International Workshop, Abingdon, U.K., 169–187.

  8. P. Miglioli, U. Moscato, and M. Ornaghi, 1994, An improved refutation system for intuitionistic predicate logic, Journal of Automated Reasoning, 12:361–373.

    Google Scholar 

  9. P. Miglioli, U. Moscato, and M. Ornaghi, 1995, Refutation systems for propositional modal logics, In P. Baumgartner, R. Hänle, and J. Posegga, editors, Theorem Proving with Analytic Tableaux and Related Methods: 4th International Workshop, Schloss Rheinfels, St. Goar, Germany, volume 918, 95–105. Springer-Verlag.

  10. G. Plotkin and C. Stirling, 1986, A framework for intuitionistic modal logic, In J.Y. Halpern, editor, Theoretical Aspects of Reasoning about Knowledge, 399–406, Morgan-Kaufmann.

  11. R.M. Smullyan, 1968, First-Order Logic, Springer, Berlin.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ferrari, M. Cut-Free Tableau Calculi for some Intuitionistic Modal Logics. Studia Logica 59, 303–330 (1997). https://doi.org/10.1023/A:1005072627389

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1005072627389

Navigation