The Modal Logic of Bayesian Belief Revision
- 44 Downloads
In Bayesian belief revision a Bayesian agent revises his prior belief by conditionalizing the prior on some evidence using Bayes’ rule. We define a hierarchy of modal logics that capture the logical features of Bayesian belief revision. Elements in the hierarchy are distinguished by the cardinality of the set of elementary propositions on which the agent’s prior is defined. Inclusions among the modal logics in the hierarchy are determined. By linking the modal logics in the hierarchy to the strongest modal companion of Medvedev’s logic of finite problems it is shown that the modal logic of belief revision determined by probabilities on a finite set of elementary propositions is not finitely axiomatizable.
KeywordsModal logic Bayesian inference Bayes learning Bayes logic Medvedev frames
We are truly grateful to the anonymous referees: their careful reading of the manuscript and their helpful comments have greatly improved the paper. We would like to thank Prof. David Makinson for his comments on an early version of this paper. Research supported in part by the Hungarian Scientific Research Found (OTKA). Contract number: K 115593. Zalán Gyenis was supported by the Premium Postdoctoral Grant of the Hungarian Academy of Sciences.
- 2.Bacchus, F. (1990). Probabilistic belief logics. In Proceedings of European conference on artificial intelligence (ECAI-90) (pp. 59–64).Google Scholar
- 3.Blackburn, P., de Rijke, M., Venema, Y. (2002). Modal logic. Cambridge University Press.Google Scholar
- 4.Chagrov, A., & Zakharyaschev, M. (1997). Modal logic. Oxford: Clarendon Press.Google Scholar
- 5.Diaconis, P., & Zabell, S. (1983). Some alternatives to Bayes’ rule. Technical Report 205 Stanford University.Google Scholar
- 6.Gärdenfors, P. (1988). Knowledge in flux: modeling the dynamics of epistemic states. MIT Press.Google Scholar
- 7.Gyenis, Z. (2018). On the modal logic of Jeffrey conditionalization. Logica Universalis. To appear.Google Scholar
- 8.Gyenis, Z. (2018). Standard Bayes logic is not finitely axiomatizable. Submitted for publication.Google Scholar
- 10.Jeffrey, R.C. (1965). The logic of decision, 1st Edn. Chicago: The University of Chicago Press.Google Scholar
- 12.Łazarz, M. (2013). Characterization of Medvedev’s logic by means of Kubiński’s frames. Bulletin of the Section of Logic, 42, 83–90.Google Scholar
- 13.Maksimova, L., Shehtman, V., Skvortsov, D. (1979). The impossibility of a finite axiomatization of Medvedev’s logic of finitary problems. Soviet Math Dokl, 20(2), 394–398.Google Scholar
- 14.Medvedev, Yu.T. (1962). Finite problems. Soviet Mathematics, 3(1), 227–230.Google Scholar
- 15.Medvedev, Yu.T. (1963). Interpretation of logical formulas by means of finite problems and its relation to the realizability theory. Soviet Mathematics, 4(1), 180–183.Google Scholar
- 16.Nilsson, N.J. (1986). Probabilistic logic. Artificial Intelligence, 71–87.Google Scholar
Open AccessThis article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.