Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
149 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Constructive S4 modal logics with the finite birelational frame property (2403.00201v2)

Published 1 Mar 2024 in cs.LO

Abstract: The logics $\mathsf{CS4}$ and $\mathsf{IS4}$ are the two leading intuitionistic variants of the modal logic $\mathsf{S4}$. Whether the finite model property holds for each of these logics have been long-standing open problems. It was recently shown that $\mathsf{IS4}$ has the finite frame property and thus the finite model property. In this paper, we prove that $\mathsf{CS4}$ also enjoys the finite frame property. Additionally, we investigate the following three logics closely related to $\mathsf{IS4}$. The logic $\mathsf{GS4}$ is obtained by adding the G\"odel--Dummett axiom to $\mathsf{IS4}$; it is both a superintuitionistic and a fuzzy logic and has previously been given a real-valued semantics. We provide an alternative birelational semantics and prove strong completeness with respect to this semantics. The extension $\mathsf{GS4c}$ of $\mathsf{GS4}$ corresponds to requiring a crisp accessibility relation on the real-valued semantics. We give a birelational semantics corresponding to an extra confluence condition on the $\mathsf{GS4}$ birelational semantics and prove strong completeness. Neither of these two logics have the finite model property with respect to their real-valued semantics, but we prove that they have the finite frame property for their birelational semantics. Establishing the finite birelational frame property immediately establishes decidability, which was previously open for these two logics. Our proofs yield NEXPTIME upper bounds. The logic $\mathsf{S4I}$ is obtained from $\mathsf{IS4}$ by reversing the roles of the modal and intuitionistic relations in the birelational semantics. We also prove the finite frame property, and thereby decidability, for $\mathsf{S4I}$

Definition Search Book Streamline Icon: https://streamlinehq.com
References (35)
  1. A modal analysis of staged computation. J. ACM, 48(3):555–604, may 2001.
  2. Recovering purity with comonads and capabilities. Proceedings of the ACM on Programming Languages, 4(ICFP):1–28, 2020.
  3. A modal foundation for secure information flow. In Workshop on Foundations of Computer Security, pages 187–203, 2004.
  4. Valentijn Anton Johan Borghuis. Coming to terms with modal logic: on the interpretation of modalities in typed lambda-calculus. PhD thesis, Technische Universiteit Eindhoven, 1994.
  5. A Computational Interpretation of Modal Proofs, pages 213–241. Springer Netherlands, Dordrecht, 1996.
  6. Fitch R.B. Symbolic logic: an introduction. Ronald Press, 1952.
  7. Ranald Clouston. Fitch-style modal lambda calculi. In Christel Baier and Ugo Dal Lago, editors, Foundations of Software Science and Computation Structures, pages 258–275, Cham, 2018. Springer International Publishing.
  8. Frederic B Fitch. Intuitionistic modal logic with quantifiers. Portugaliae mathematica, 7(2):113–118, 1948.
  9. Duminda Wijesekera. Constructive modal logics I. Annals of Pure and Applied Logic, 50(3):271–301, 1990.
  10. A. Simpson. The proof theory and semantics of intuitionistic modal logic. PhD thesis, University of Edinburgh, Edinburgh, UK, 1994.
  11. Categorical and Kripke semantics for constructive S4 modal logic. In Proceedings of 15th International Workshop on Computer Science Logic (CSL 2001), 10th Annual Conference of the EACSL, Paris, France, volume 2142 of Lecture Notes in Computer Science, pages 292–307. Springer, 2001.
  12. Intuitionistic S4 is decidable. In LICS, pages 1–13, 2023.
  13. F. Wolter and M. Zakharyaschev. The relation between intuitionistic and classical modal logics. Algebra and Logic, 36(2):73–92, Mar 1997.
  14. Intuitionistic modal logic. In Logic and Foundations of Mathematics: Selected Contributed Papers of the 10th International Congress of Logic, Methodology and Philosophy of Science, Florence, Italy, pages 227–238. Springer, Dordrecht, Netherlands, 1999.
  15. X. Caicedo and R. Rodríguez. Standard Gödel modal logics. Studia Logica, 94:189–214, 2010.
  16. K. Gödel. Zum intuitionistischen aussagenkalkül. Anzeiger der Akademie der Wissenschaften in Wien, 69:65–66, 1932.
  17. A. Heyting. Die formalen Regeln der intuitionistischen Logik. In Sitzungsberichte der Preussischen Akademie der Wissenschaften, page 42–56. Deutsche Akademie der Wissenschaften zu Berlin, 1930. Reprint in Logik-Texte: Kommentierte Auswahl zur Geschichte der Modernen Logik, Akademie-Verlag, 1986.
  18. Gisèle Fischer Servi. On modal logic with an intuitionistic base. Studia Logica, 36(3):141–149, 1977.
  19. Towards a proof theory of Gödel modal logics. Logical Methods in Computer Science, 7(2), 2011.
  20. Proof systems for a Gödel modal logic. In Proceedings of the 18th International Conference on Automated Reasoning with Analytic Tableaux and Related Methods (TABLEAUX 2009), Oslo, Norway, volume 5607 of Lecture Notes in Computer Science, pages 265–279. Springer, 2009.
  21. A finite model property for Gödel modal logics. In Proceedings of the 20th International Workshop on Logic, Language, Information, and Computation (WoLLIC 2013), Darmstadt, Germany, volume 8071 of Lecture Notes in Computer Science, pages 226–237. Springer, 2013.
  22. Petr Hájek. Metamathematics of Fuzzy Logic. Springer, Dordrecht, Netherlands, 1998.
  23. Time and Gödel: Fuzzy temporal reasoning in PSPACE. In Proceedings of the 28th Workshop on Logic, Language, Information and Computation - 28th International Conference (WoLLIC 2022), Icşi, Romania, pages 18–35, 2022.
  24. A Gödel calculus for linear temporal logic. In Proceedings of the 19th International Conference on Principles of Knowledge Representation and Reasoning - 19th International Conference (KR 2022), Haifa, Israel, pages 2–11. IJCAI, 2022.
  25. Bi-modal Gödel logic over [0, 1]-valued Kripke frames. Journal of Logic and Computation, 25(1):37–55, 2015.
  26. Axiomatization of crisp Gödel modal logic. Studia Logica, 109(2):367–395, 2021.
  27. Shallow models for non-iterative modal logics. In KI 2008: Advances in Artificial Intelligence, 31st Annual German Conference on AI, Kaiserslautern, Germany, pages 324–331, Berlin, Heidelberg, 2008. Springer.
  28. Some constructive variants of S4 with the finite model property. In Proceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science, (LICS 2021), pages 1–13. IEEE, 2021.
  29. Decidability for 𝖲𝟦𝖲𝟦\mathsf{S4}sansserif_S4 Gödel modal logics. In María Eugenia Cornejo, István Á. Harmati, László T. Kóczy, and Jesús Medina-Moreno, editors, Computational Intelligence and Mathematics for Tackling Complex Problems 4, pages 1–7. Springer International Publishing, 2023.
  30. Gisèle Fischer Servi. Axiomatizations for some intuitionistic modal logics. Rendiconti del Seminario Matematico Università e Politecnico di Torino, 42(3):179–194, 1984.
  31. On nested sequents for constructive modal logics. Logical Methods in Computer Science, 11(3), 2015.
  32. Non-primitive recursive decidability of products of modal logics with expanding domains. Annals of Pure and Applied Logic, 142(1-3):245–268, 2006.
  33. Intuitionistic linear temporal logics. ACM Transactions on Computational Logic, 21(2):14:1–14:32, 2020.
  34. A natural intuitionistic modal logic: Axiomatization and bi-nested calculus. CoRR, abs/2309.06309, 2023.
  35. A Family of Decidable Bi-intuitionistic Modal Logics. In Proceedings of the 20th International Conference on Principles of Knowledge Representation and Reasoning, pages 262–271, 8 2023.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now