Skip to main content
SpringerLink
Log in

Linear Depth Deduction with Subformula Property for Intuitionistic Epistemic Logic

  • Published:
Journal of Automated Reasoning Aims and scope Submit manuscript

Abstract

In their seminal paper Artemov and Protopopescu provide Hilbert formal systems, Brower–Heyting–Kolmogorov and Kripke semantics for the logics of intuitionistic belief and knowledge. Subsequently Krupski has proved that the logic of intuitionistic knowledge is PSPACE-complete and Su and Sano have provided calculi enjoying the subformula property. This paper continues the investigations around sequent calculi for Intuitionistic Epistemic Logics by providing sequent calculi that have the subformula property and that are terminating in linear depth. Our calculi allow us to design a procedure that for invalid formulas returns a Kripke model of minimal depth. Finally we also discuss refutational sequent calculi, that is sequent calculi to prove that formulas are invalid.

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Artëmov, S.N., Protopopescu, T.: Intuitionistic epistemic logic. Rev. Symb. Log. 9(2), 266–298 (2016). https://doi.org/10.1017/S1755020315000374

    Article  MathSciNet  MATH  Google Scholar 

  2. Brogi, C.P.: Curry-howard-lambek correspondence for intuitionistic belief. CoRR (2020). arXiv:2006.02417

  3. Chagrov, A., Zakharyaschev, M.: Modal Logic. Oxford University Press, Oxford (1997)

    MATH  Google Scholar 

  4. 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. Automated Reason. 51(2), 129–149 (2013). https://doi.org/10.1007/s10817-012-9252-7

    Article  MathSciNet  MATH  Google Scholar 

  5. Ferrari, M., Fiorentini, C., Fiorino, G.: An evaluation-driven decision procedure for G3i. ACM Trans. Comput. Logic 6(1), 8:1-8:37 (2015)

    MathSciNet  MATH  Google Scholar 

  6. Fitting, M.: Intuitionistic Logic, Model Theory and Forcing. North-Holland, Amsterdam (1969)

    MATH  Google Scholar 

  7. Fitting, M.: Nested sequents for intuitionistic logics. Notre Dame J. Formal Log. 55(1), 41–61 (2014). https://doi.org/10.1215/00294527-2377869

    Article  MathSciNet  MATH  Google Scholar 

  8. Hudelmaier, J.: An \({O}(n \log n)\)- space decision procedure for intuitionistic propositional logic. J. Logic Comput. 3(1), 63–75 (1993)

    Article  MathSciNet  MATH  Google Scholar 

  9. Krupski, V.N., Yatmanov, A.: Sequent calculus for intuitionistic epistemic logic IEL. In: Artëmov, S.N., Nerode, A. (eds.) Logical Foundations of Computer Science—International Symposium, LFCS 2016, Deerfield Beach, FL, USA, January 4–7, 2016. Proceedings, Lecture Notes in Computer Science, vol. 9537, pp. 187–201. Springer (2016). https://doi.org/10.1007/978-3-319-27683-0_14

  10. Rogozin, D.: Modal type theory based on the intuitionistic modal logic \(\textbf{IEL}\). In: Artëmov, S.N., Nerode, A. (eds.) Logical Foundations of Computer Science—International Symposium, LFCS 2020, Deerfield Beach, FL, USA, January 4–7, 2020, Proceedings, Lecture Notes in Computer Science, vol. 11972, pp. 236–248. Springer (2020). https://doi.org/10.1007/978-3-030-36755-8_15

  11. Su, Y., Sano, K.: First-order intuitionistic epistemic logic. In: Blackburn, P., Lorini, E., Guo, M. (eds.) Logic, Rationality, and Interaction—7th International Workshop, LORI 2019, Chongqing, China, October 18-21, 2019, Proceedings, Lecture Notes in Computer Science, vol. 11813, pp. 326–339. Springer (2019). https://doi.org/10.1007/978-3-662-60292-8_24

  12. Troelstra, A., van Dalen, D.: Constructivism in Mathematics: An Introduction. Studies in Logic and the Foundations of Mathematics, vol. 121. North-Holland, Amsterdam (1988)

    MATH  Google Scholar 

  13. Troelstra, A., Schwichtenberg, H.: Basic Proof Theory, vol. 43. Cambridge Tracts in Theoretical Computer Science, Cambridge University Press, Cambridge (1996)

    MATH  Google Scholar 

  14. Vorob’ev, N.N.: A new algorithm of derivability in a constructive calculus of statements. In: Sixteen papers on logic and algebra. American Mathematical Society Translations, Series 2, vol. 94, pp. 37–71. American Mathematical Society, Providence (1970)

Download references

Author information

Authors and Affiliations

  1. DISCO, Università degli Studi di Milano-Bicocca, Viale Sarca, 336, 20126, Milan, Italy

    Guido Fiorino

Authors
  1. Guido Fiorino
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Guido Fiorino.

Additional information

Publisher's Note

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

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

Fiorino, G. Linear Depth Deduction with Subformula Property for Intuitionistic Epistemic Logic. J Autom Reasoning 67, 3 (2023). https://doi.org/10.1007/s10817-022-09653-z

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s10817-022-09653-z

Keywords

Search

Navigation