In the paper [http://philsci-archive.pitt.edu/14136] a hierarchy of modal logics have been defined to capture the logical features of Bayesian belief revision. Elements in that hierarchy were distinguished by the cardinality of the set of elementary propositions. By linking the modal logics in the hierarchy to Medvedev's logic of (in)finite problems it has been shown that the modal logic of Bayesian belief revision determined by probabilities on a finite set of elementary propositions is not finitely axiomatizable. However, the infinite case remained open. In this paper we prove that the modal logic of Bayesian belief revision determined by standard Borel spaces (these cover probability spaces that occur in most of the applications) is also not finitely axiomatizable
