Abstract
The aim of this paper is to study a particular family of non-deterministic semantics for modal logics that has eight truth-values. These eight-valued semantics can be traced back to Omori and Skurt (2016), where a particular member of this family was used to characterize the normal modal logic K. The truth-values in these semantics convey information about a proposition’s truth/falsity, whether the proposition is necessary/not necessary, and whether it is possible/not possible. Each of these triples is represented by a unique value. In this paper we will study which modal logics can be obtained by changing the interpretation of the \(\Box \) modality, assuming that the interpretation of other connectives stays constant. We will show what axioms are responsible for a particular interpretations of \(\Box \). Furthermore, we will study subsets of these axioms. We show that some of the combinations of the axioms are equivalent to well-known modal axioms. We apply the level-valuation technique to all of the systems to regain the closure under the rule of necessitation. We also point out that some of the resulting logics are not sublogics of S5 and comment briefly on the corresponding frame conditions that are forced by these axioms. Ultimately, we sketch a proof of meta-completeness for all of these systems.
Similar content being viewed by others
References
Omori, H., & Skurt, D. (2016). More modal semantics without possible worlds. IfCoLog Journal of Logics and their Applications, 3(5), 815–845.
Avron, A., & Zamansky, A. (2011). Non-deterministic semantics for logical systems. In: Gabbay, Guenthner (eds.) Handbook of Philosophical Logic, Springer, 16
Ivlev, Y.V. (1991). Modal Logic. (in Russian), p. 224. Moskva: Moskovskij Gosudarstvennyj Universitet
Kearns, J. T. (1981). Modal semantics without possible worlds. The Journal of Symbolic Logic, 46(1), 77–86. https://doi.org/10.2307/2273259
Coniglio, M. E., Luis, F. D. C., & Newton, M. P. (2015). Finite non-deterministic semantics for some modal systems. Journal of Applied Non-Classical Logics, 25(1), 20–45. https://doi.org/10.1080/11663081.2015.1011543
Coniglio, M. E., Luis, F. D. C., & Newton, M. P. (2016). Errata and addenda to ‘finite non-deterministic semantics for some modal systems’. Journal of Applied Non-Classical Logics, 26(4), 336–345. https://doi.org/10.1080/11663081.2017.1300436
Coniglio, M. E., Luis, F. D. C., & Newton, M. P. (2019). Modal logic with non-deterministic semantics: Part I—Propositional case. Logic Journal of the IGPL, 281–315. https://doi.org/10.1093/jigpal/jzz027, https://academic.oup.com/jigpal/advance-article-pdf/doi/10.1093/jigpal/jzz027/30101966/jzz027.pdf
Coniglio, M.E., Luis, F.D.C., & Newton, M.P. (2021). Modal Logic With Non-Deterministic Semantics: Part II—Quantified Case. Logic Journal of the IGPL, 695–727. https://doi.org/10.1093/jigpal/jzab020, https://academic.oup.com/jigpal/advance-article-pdf/doi/10.1093/jigpal/jzab020/38609545/jzab020.pdf
Grätz, L. (2022). Truth tables for modal logics T and S4, by using three-valued non-deterministic level semantics. Journal of Logic and Computation, 32(1), 129–157.
Lahav, O., & Zohar, Y. (2022). Effective semantics for the modal logics K and KT via non-deterministic matrices. In: Blanchette, J., Kovács, L., Pattinson, D. (eds.) Automated Reasoning, Springer, pp 468–485
Omori, H., & Skurt, D. (2020). A semantics for a failed axiomatization of K. In: Olivietti, N., Verbrugge, R., Negri, S., Sandu, G. (eds.) Advances in Modal Logic. College Publications 13, 481–501
Omori, H., & Skurt, D. (2022). On Ivlev’s semantics for modality. In: Coniglio, M.E., Kubyshkina, E., Zaitsev, D.V. (eds.) Many-valued Semantics and Modal Logics. Essays in Honour of Yuri V. Ivlev. Springer. forthcoming
Pawlowski, P., & La Rosa, E. (2022). Modular non-deterministic semantics for T, TB, S4, S5 and more. Journal of Logic and Computation, 32(1), 158–171.
Dimiter Georgiev, T.T., & Vakarelov, D. (2022). SQEMA - an algorithm for computing first-order correspondences in modal logic: an implementation. Sofia University
Humberstone, L. (2016). Philosophical Applications of Modal Logic. College Publications
Segerberg, K.K. (1971). An Essay in Classical Modal Logic. The Philosophical Society in Uppsala
Wansing, H. (1989). Bemerkungen zur Semantik nicht-normaler möglicher Welten. Mathematical Logic Quarterly, 35(6), 551–557.
Priest, G. (2008). An Introduction to Non-Classical Logic, 2nd edn. Cambridge University Press. https://doi.org/10.1017/cbo9780511801174
Coniglio, M. E., & Golzio, A. C. (2019). Swap structures semantics for Ivlev-like modal logics. Soft Computing, 23(7), 2243–2254. https://doi.org/10.1007/s00500-018-03707-4
Coniglio, M. E., Figallo-Orellano, A., & Golzio, A. C. (2020). Non-deterministic algebraization of logics by swap structures. Logic Journal of the IGPL, 28(5), 1021–1059.
Coniglio, M.E., & Rodrigues, A. (2022). On six-valued logics of evidence and truth expanding Belnap-dunn four-valued logic. arXiv:2209.12337
Vakarelov, D. (1977). Notes on n-lattices and constructive logic with strong negation. Studia Logica: An International Journal for Symbolic Logic, 36(1/2), 109–125.
Coniglio, M. E., & Toledo, G. V. (2022). Two Decision Procedures for da Costa’s \(C_n\) Logics Based on Restricted Nmatrix Semantics. Studia Logica, 110(3), 601–642.
Acknowledgements
Pawel Pawlowski has been supported by the BOF (Bijzonder Onderzoeksfonds) post-doctoral mandate and Daniel Skurt has been partially supported by the Deutsche Forschungsgemeinschaft, DFG, grant SK 379/1-1.
Author information
Authors and Affiliations
Corresponding authors
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Appendix
Appendix
1.1 Appendix A Proof of Lemma 4 for \(\textbf{HK}\)
Let \(\Gamma \) be an HK-maxcon. We will now show that \(v_\Gamma \) is a well defined HK-valuation, i.e. \(v_\Gamma \) is faithful to the truth-tables. The desired result is proved by induction on the number of connectives.
Base: For atomic formulas the result holds per definition.
Induction step: We have to split the cases based on the connectives.
Case 1:
cases | \(v_\Gamma (\varphi )\) | condition for \(\varphi \) | \(v_\Gamma (\lnot \varphi )\) | condition for \(\lnot \varphi \) |
---|---|---|---|---|
(a) | \(\texttt{T}_{\Diamond }\) | \(\Gamma \vdash \varphi \) and \(\Gamma \vdash \Box \varphi \) and \(\Gamma \vdash \Diamond \varphi \) | \(\texttt{f}\) | \(\Gamma \nvdash \lnot \varphi \) and \(\Gamma \nvdash \Box \lnot \varphi \) and \(\Gamma \nvdash \Diamond \lnot \varphi \) |
(b) | \(\texttt{T}\) | \(\Gamma \vdash \varphi \) and \(\Gamma \vdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \varphi \) | \(\texttt{F}\) | \(\Gamma \nvdash \lnot \varphi \) and \(\Gamma \vdash \Box \lnot \varphi \) and \(\Gamma \nvdash \Diamond \lnot \varphi \) |
(c) | \(\texttt{t}_{\Diamond }\) | \(\Gamma \vdash \varphi \) and \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \vdash \Diamond \varphi \) | \(\texttt{f}_{\Diamond }\) | \(\Gamma \nvdash \lnot \varphi \) and \(\Gamma \nvdash \Box \lnot \varphi \) and \(\Gamma \vdash \Diamond \lnot \varphi \) |
(d) | \(\texttt{t}\) | \(\Gamma \vdash \varphi \) and \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \varphi \) | \(\texttt{F}_{\Diamond }\) | \(\Gamma \nvdash \lnot \varphi \) and \(\Gamma \vdash \Box \lnot \varphi \) and \(\Gamma \vdash \Diamond \lnot \varphi \) |
(e) | \(\texttt{F}_{\Diamond }\) | \(\Gamma \nvdash \varphi \) and \(\Gamma \vdash \Box \varphi \) and \(\Gamma \vdash \Diamond \varphi \) | \(\texttt{t}\) | \(\Gamma \vdash \lnot \varphi \) and \(\Gamma \nvdash \Box \lnot \varphi \) and \(\Gamma \nvdash \Diamond \lnot \varphi \) |
(f) | \(\texttt{F}\) | \(\Gamma \nvdash \varphi \) and \(\Gamma \vdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \varphi \) | \(\texttt{T}\) | \(\Gamma \vdash \lnot \varphi \) and \(\Gamma \vdash \Box \lnot \varphi \) and \(\Gamma \nvdash \Diamond \lnot \varphi \) |
(g) | \(\texttt{f}_{\Diamond }\) | \(\Gamma \nvdash \varphi \) and \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \vdash \Diamond \varphi \) | \(\texttt{t}_{\Diamond }\) | \(\Gamma \vdash \lnot \varphi \) and \(\Gamma \nvdash \Box \lnot \varphi \) and \(\Gamma \vdash \Diamond \lnot \varphi \) |
(h) | \(\texttt{f}\) | \(\Gamma \nvdash \varphi \) and \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \varphi \) | \(\texttt{T}_{\Diamond }\) | \(\Gamma \vdash \lnot \varphi \) and \(\Gamma \vdash \Box \lnot \varphi \) and \(\Gamma \vdash \Diamond \lnot \varphi \) |
By induction hypothesis we have the conditions for \(\varphi \). The conditions for \(\lnot \varphi \) will then be proven with the help of the axioms Dual i, for \(i \in \{1,2,3,4\}\) and a maximal HK-consistent set. Case (a) will be shown in detail for the other case we trust the reader to fill in the details:
-
(a)
\(\Gamma \nvdash \lnot \varphi \) follows from the fact that \(\Gamma \) is an HK-maxcon and \(v_\Gamma (\varphi )\). \(\Gamma \nvdash \Box \lnot \varphi \) follows from \(\Gamma \vdash \Diamond \varphi \), \(\Gamma \vdash \Diamond \varphi \rightarrow \lnot \Box \lnot \varphi \) (Dual 3) and the fact that \(\Gamma \) is an HK-maxcon. \(\Gamma \nvdash \Diamond \lnot \varphi \) follows from \(\Gamma \vdash \Box \varphi \), \(\Gamma \vdash \Box \varphi \rightarrow \lnot \Diamond \lnot \varphi \) (Dual 4) and the fact that \(\Gamma \) is an HK-maxcon.
-
(b)
by Dual 2 and Dual 4.
-
(c)
by Dual 1 and Dual 3.
-
(d)
by Dual 1 and Dual 2.
-
(e)
by Dual 3 and Dual 4.
-
(f)
by Dual 2 and Dual 4.
-
(g)
by Dual 1 and Dual 3.
-
(h)
by Dual 1 and Dual 4.
Case 2:
cases | \(v_\Gamma (\varphi )\) | condition for \(\varphi \) | \(v_\Gamma (\Box \varphi )\) | condition for \(\Box \varphi \) |
---|---|---|---|---|
(a) | \(\texttt{T}_{\Diamond }\) | \(\Gamma \vdash \varphi \) and \(\Gamma \vdash \Box \varphi \) and \(\Gamma \vdash \Diamond \varphi \) | \(\texttt{D}\) | \(\Gamma \vdash \Box \varphi \) |
(b) | \(\texttt{T}\) | \(\Gamma \vdash \varphi \) and \(\Gamma \vdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \varphi \) | \(\texttt{D}\) | \(\Gamma \vdash \Box \varphi \) |
(c) | \(\texttt{t}_{\Diamond }\) | \(\Gamma \vdash \varphi \) and \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \vdash \Diamond \varphi \) | \(\overline{\texttt{D}}\) | \(\Gamma \nvdash \Box \varphi \) |
(d) | \(\texttt{t}\) | \(\Gamma \vdash \varphi \) and \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \varphi \) | \(\overline{\texttt{D}}\) | \(\Gamma \nvdash \Box \varphi \) |
(e) | \(\texttt{F}_{\Diamond }\) | \(\Gamma \nvdash \varphi \) and \(\Gamma \vdash \Box \varphi \) and \(\Gamma \vdash \Diamond \varphi \) | \(\texttt{D}\) | \(\Gamma \vdash \Box \varphi \) |
(f) | \(\texttt{F}\) | \(\Gamma \nvdash \varphi \) and \(\Gamma \vdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \varphi \) | \(\texttt{D}\) | \(\Gamma \vdash \Box \varphi \) |
(g) | \(\texttt{f}_{\Diamond }\) | \(\Gamma \nvdash \varphi \) and \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \vdash \Diamond \varphi \) | \(\overline{\texttt{D}}\) | \(\Gamma \nvdash \Box \varphi \) |
(h) | \(\texttt{f}\) | \(\Gamma \nvdash \varphi \) and \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \varphi \) | \(\overline{\texttt{D}}\) | \(\Gamma \nvdash \Box \varphi \) |
By induction hypothesis we have the conditions for \(\varphi \) and it is easy to see that the conditions for \(\Box \varphi \) are provable.
We leave the case of implication safely to the reader.
1.2 Appendix B Proof of Lemma 4 for \(\textbf{HK}_{2bcd32g3}\)
The truth-table for \(\Box \) is then as follows:
\(\texttt{T}_{\Diamond }\) | \(\texttt{T}\) | \(\texttt{t}_{\Diamond }\) | \(\texttt{t}\) | \(\texttt{F}_{\Diamond }\) | \(\texttt{F}\) | \(\texttt{f}_{\Diamond }\) | \(\texttt{f}\) | |
---|---|---|---|---|---|---|---|---|
\(\widetilde{\Box }\varphi \) | \(\texttt{T}_{\Diamond }, \texttt{T}\) | \(\texttt{D}\) | \(\overline{\texttt{D}}\) | \(\overline{\texttt{D}}\) | \(\texttt{T}, \texttt{t}\) | \(\texttt{T}_{\Diamond }, \texttt{T}\) | \(\overline{\texttt{D}}\) | \(\texttt{F}, \texttt{f}\) |
Let \(\Gamma \) be an HK\(_{2bcd32g3}\)-maxcon. We will now show that \(v_\Gamma \) is a well defined HK\(_{2bcd32g3}\)-valuation, i.e. \(v_\Gamma \) is faithful to the truth-table for \(\Box \). The desired result is again proved by induction on the number of connectives.
Base: For atomic formulas the result holds per definition.
Induction step: We have to split the cases based on the connectives. We will only prove the case for \(\Box \), the cases for \(\lnot \) and \(\rightarrow \) are as above.
cases | \(v_\Gamma (\varphi )\) | condition for \(\varphi \) | \(v_\Gamma (\Box \varphi )\) | condition for \(\Box \varphi \) |
---|---|---|---|---|
(a) | \(\texttt{T}_{\Diamond }\) | \(\Gamma \vdash \varphi \) and \(\Gamma \vdash \Box \varphi \) and \(\Gamma \vdash \Diamond \varphi \) | \(\texttt{T}_{\Diamond }, \texttt{T}\) | \(\Gamma \vdash \Box \varphi \) and \(\Gamma \vdash \Box \Box \varphi \) |
(b) | \(\texttt{T}\) | \(\Gamma \vdash \varphi \) and \(\Gamma \vdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \varphi \) | \(\texttt{D}\) | \(\Gamma \vdash \Box \varphi \) |
(c) | \(\texttt{t}_{\Diamond }\) | \(\Gamma \vdash \varphi \) and \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \vdash \Diamond \varphi \) | \(\overline{\texttt{D}}\) | \(\Gamma \nvdash \Box \varphi \) |
(d) | \(\texttt{t}\) | \(\Gamma \vdash \varphi \) and \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \varphi \) | \(\overline{\texttt{D}}\) | \(\Gamma \nvdash \Box \varphi \) |
(e) | \(\texttt{F}_{\Diamond }\) | \(\Gamma \nvdash \varphi \) and \(\Gamma \vdash \Box \varphi \) and \(\Gamma \vdash \Diamond \varphi \) | \(\texttt{T}, \texttt{t}\) | \(\Gamma \vdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \Box \varphi \) |
(f) | \(\texttt{F}\) | \(\Gamma \nvdash \varphi \) and \(\Gamma \vdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \varphi \) | \(\texttt{T}_{\Diamond }, \texttt{T}\) | \(\Gamma \vdash \Box \varphi \) and \(\Gamma \vdash \Box \Box \varphi \) |
(g) | \(\texttt{f}_{\Diamond }\) | \(\Gamma \nvdash \varphi \) and \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \vdash \Diamond \varphi \) | \(\overline{\texttt{D}}\) | \(\Gamma \nvdash \Box \varphi \) |
(h) | \(\texttt{f}\) | \(\Gamma \nvdash \varphi \) and \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \varphi \) | \(\texttt{F}, \texttt{f}\) | \(\Gamma \nvdash \Box \varphi \) and \(\Gamma \nvdash \Diamond \Box \varphi \) |
By induction hypothesis, we have the conditions for \(\varphi \), and then we can see that the conditions for \(\Box \varphi \) are provable:
-
(a)
by \(\Box \varphi \wedge \varphi \wedge \Diamond \varphi \rightarrow \Box \Box \varphi \) (A2) and the condition for \(\varphi \).
-
(b)
by the condition for \(\varphi \).
-
(c)
by the condition for \(\varphi \).
-
(d)
by the condition for \(\varphi \).
-
(e)
by \(\Box \varphi \wedge \lnot \varphi \wedge \Diamond \varphi \rightarrow \lnot \Diamond \Box \varphi \) (E3) and the condition for \(\varphi \).
-
(f)
by \(\Box \varphi \wedge \lnot \varphi \wedge \lnot \Diamond \varphi \rightarrow \Box \Box \varphi \) (F2) and the condition for \(\varphi \).
-
(g)
by the condition for \(\varphi \).
-
(h)
by \(\lnot \Box \varphi \wedge \lnot \varphi \wedge \lnot \Diamond \varphi \rightarrow \lnot \Diamond \Box \varphi \) (H3) and the condition for \(\varphi \).
This proof for the canonical model construction obviously shows the correspondence between axioms and the refinements. We sincerely hope this justifies that we left out proofs for all the other possible combinations of axioms we could add to \(\textbf{HK}\).
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.
About this article
Cite this article
Pawlowski, P., Skurt, D. 8 Valued Non-Deterministic Semantics for Modal Logics. J Philos Logic 53, 351–371 (2024). https://doi.org/10.1007/s10992-023-09733-4
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10992-023-09733-4