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. The containment relations among the modal logics in the hierarchy are determined. By linking the modal logics in the hierarchy to Medvedev’s logic of finite problems and to Skvortsov’s logic of infinite 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