Abstract
We consider extending the modal logic KD45, commonly taken as the baseline system for belief, with propositional quantifiers that can be used to formalize natural language sentences such as “everything I believe is true” or “there is something that I neither believe nor disbelieve.” Our main results are axiomatizations of the logics with propositional quantifiers of natural classes of complete Boolean algebras with an operator (BAOs) validating KD45. Among them is the class of complete, atomic, and completely multiplicative BAOs validating KD45. Hence, by duality, we also cover the usual method of adding propositional quantifiers to normal modal logics by considering their classes of Kripke frames. In addition, we obtain decidability for all the concrete logics we discuss.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Belardinelli, F., Van Der Hoek, W, & Kuijer, L.B. (2018). Second-order propositional modal logic: Expressiveness and completeness results. Artificial Intelligence, 263, 3–45.
Hintikka, J. (1962). Knowledge and belief: an introduction to the logic of the two notions.
Yap, A. (2014). Idealization, epistemic logic, and epistemology. Synthese, 191(14), 3351–3366.
Caie, M. (2019). Doxastic logic. In Weisberg, J., & Pettigrew, R. (Eds.), The Open Handbook of Formal Epistemology (pp. 499–541): PhilPapers Foundation.
Slaney, J. (1996). KD45 is not a doxastic logic. Technical Report, TR-SRS-3-96, Australian National University.
Baltag, A, Bezhanishvili, N, Özgün, A., & Smets, S. (2019). A topological approach to full belief. Journal of Philosophical Logic, 48(2), 205–244.
Baltag, A., Bezhanishvili, N, Özgün, A., & Smets, S. (2017). The topology of full and weak belief. In Hansen, H.H., Murray, S.E., Sadrzadeh, M., & Zeevat, H. (Eds.) Logic, Language, and Computation (pp. 205–228). Berlin: Springer.
Lewis, D. (1986). On the plurality of worlds Vol. 322: Oxford Blackwell.
Blackburn, P., De Rijke, M, & Venema, Y. (2002). Modal logic: graph Vol. 53. darst: Cambridge University Press.
Segerberg, K. (1971). An essay in classical modal logic.
van Benthem, J, & Smets, S. van Ditmarsch, H., Halpern, J.Y., van der Hoek, W., & Kooi, B. (Eds.). (2015). Dynamic logics of belief change: College Publications.
Holliday, W.H, & Litak, T. (2019). Complete additivity and modal incompleteness. The Review of Symbolic Logic, 12(3), 487–535.
Clarke, R. (2013). Belief is credence one (in context). Philosopher’s Imprint 13(11).
Tokarz, M. (1990). On the logic of conscious belief. Studia Logica, 49(3), 321–332.
Fine, K. (1969). For some proposition and so many possible worlds. Ph.D. Thesis, University of Warwick. http://wrap.warwick.ac.uk/72219/.
Kripke, S.A. (1959). A completeness theorem in modal logic. The journal of symbolic logic, 24(01), 1–14.
Bull, R.A. (1969). On modal logic with propositional quantifiers. The Journal of Symbolic Logic, 34(2), 257–263.
Gabbay, D.M. (1971). Montague type semantics for modal logics with propositional quantifiers. Mathematical Logic Quarterly, 17(1), 245–249.
Fine, K. (1970). Propositional quantifiers in modal logic. Theoria, 36(3), 336–346.
Grover, D.L. (1972). Propositional quantifiers. Journal of Philosophical Logic, 1(2), 111–136.
Kaminski, M., & Tiomkin, M. (1996). The expressive power of second-order propositional modal logic. Notre Dame Journal of Formal Logic, 37(1), 35–43.
Kuusisto, A. (2008). A modal perspective on monadic second-order alternation hierarchies. Advances in Modal Logic, 2008, 231–247.
Kuusisto, A. (2015). Second-order propositional modal logic and monadic alternation hierarchies. Annals of Pure and Applied Logic, 166(1), 1–28.
Ten Cate, B. (2006). Expressivity of second order propositional modal logic. Journal of Philosophical Logic, 35(2), 209–223.
Antonelli, G.A, & Thomason, RH. (2002). Representability in second-order propositional poly-modal logic. The Journal of Symbolic Logic, 67(03), 1039–1054.
Kuhn, S. (2004). A simple embedding of T into double S5. Notre Dame Journal of Formal Logic, 45(1), 13–18.
Kremer, P. (1997). On the complexity of propositional quantification in intuitionistic logic. The Journal of Symbolic Logic, 62(02), 529–544.
Fritz, P. (2017). Logics for propositional contingentism. The Review of Symbolic Logic, 10(2), 203–236.
Fritz, P. (2018). Propositional quantification in bimodal S5. Erkenntnis: An International Journal of Scientific Philosophy.
Kremer, P. (1993). Quantifying over propositions in relevance logic: nonaxiomatisability of primary interpretations of ∀ p and ∃ p. The Journal of Symbolic Logic, 58(01), 334–349.
Kremer, P. (2018). Completeness of second-order propositional S4 and H in topological semantics. The Review of Symbolic Logic, 11(3), 507–518.
Ghilardi, S., & Zawadowski, M. (1995). Undefinability of propositional quantifiers in the modal system S4. Studia Logica, 55(2), 259–271.
Zach, R. (2004). Decidability of quantified propositional intuitionistic logic and S4 on trees of height and arity ≤ ω. Journal of Philosophical Logic, 33(2), 155–164.
Belardinelli, F., & Van Der Hoek, W. (2015). Epistemic quantified boolean logic: Expressiveness and completeness results. In 24th International Joint Conferences on Artificial Intelligence (IJCAI 2015) (pp. 2748–2754).
Belardinelli, F., van Ditmarsch, H., & van der Hoek, W. (2016). Second-order propositional announcement logic. In Proceedings of the 2016 International Conference on Autonomous Agents & Multiagent Systems (pp. 635–643): International Foundation for Autonomous Agents and Multiagent Systems.
Belardinelli, F, & Van Der Hoek, W. (2016). A semantical analysis of second-order propositional modal logic. In Thirtieth AAAI Conference on Artificial Intelligence.
Fan, T-F, & Liau, C-J. (2017). Doxastic reasoning with multi-source justifications based on second order propositional modal logic. In Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems (pp. 1529–1531): International Foundation for Autonomous Agents and Multiagent Systems.
Bednarczyk, B, & Demri, S. (2019). Why propositional quantification makes modal logics on trees robustly hard?. In 2019 34th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (pp. 1–13): IEEE.
French, T. (2003). Quantified propositional temporal logic with repeating states. In 10th International Symposium on Temporal Representation and Reasoning, 2003 and Fourth International Conference on Temporal Logic. Proceedings (pp. 155–165): IEEE.
Holliday, W.H. (2017). A note on algebraic semantics for S5 with propositional quantifiers. Notre Dame Journal of Formal Logic.
Holliday, W.H, & Litak, T. (2018). One modal logic to rule them all?. In Advances in Modal Logic 12, proceedings of the 12th conference on “Advances in Modal Logic,” held in Bern, Switzerland, August 27-31, 2018 (pp. 367–386). http://www.aiml.net/volumes/volume12/Holliday-Litak.pdf.
Ding, Y. (2018). On the logics with propositional quantifiers extending S5π In Advances in Modal Logic 12, proceedings of the 12th conference on “Advances in Modal Logic,” held in Bern, Switzerland, August 27-31, 2018 (pp. 219–235). http://www.aiml.net/volumes/volume12/Ding.pdf.
Davey, B.A, & Priestley, HA. (2002). Introduction to lattices and order. Cambridge university press.
Bezhanishvili, N. (2002). Pseudomonadic algebras as algebraic models of doxastic modal logic. Mathematical Logic Quarterly, 48(4), 624.
Fritz, P. (2016). Propositional contingentism. The Review of Symbolic Logic, 9(01), 123–142.
Gehrke, M., Harding, J, & Venema, Y. (2006). Macneille completions and canonical extensions. Transactions of the American Mathematical Society, 358(2), 573–590.
Harding, J., & Bezhanishvili, G. (2007). Macneille completions of modal algebras. Houston Journal of Mathematics, 33(2), 355–384.
Koppelberg, S. (1988). Algebraic theory. In Mond, JD, & Bonnet, R (Eds.) Handbook of Boolean Algebras, Vol. 1: Elsevier.
Louveau, A. (1973). Caractérisation des sous-espaces compacts de βn. Bulletin des Sciences Mathematiques, 97.
Dow, A., & Vermeer, J. (1992). Not all σ-complete boolean algebras are quotients of complete boolean algebras. Proceedings of the American Mathematical Society, 116(4), 1175–1177.
Vermeer, J. (1996). Quotients of complete boolean algebras. Annals of the New York Academy of Sciences, 788(1), 209–213.
Chang, C.C, & Keisler, H.J. (1990). Model theory Vol. 73: Elsevier.
Givant, S., & Halmos, P. (2008). Introduction to boolean algebras. Springer Science & Business Media.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
I thank Wesley Holliday for his numerous helpful suggestions and Fengkui Ju at the 2019 Modal Logic Workshop at Peking University for reminding me that 4∀ strengthens 4.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Ding, Y. On the Logic of Belief and Propositional Quantification. J Philos Logic 50, 1143–1198 (2021). https://doi.org/10.1007/s10992-021-09595-8
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10992-021-09595-8