Summary: We add a binary operator \(\geq \) to the logical language, with intended meaning of \(\varphi <\psi\): ‘\(\varphi \) is at least as likely, probable, or trustworthy, as \(\psi \)’. The operator \(\geq \) is interpreted on Kripke structures, making it possible to define the standard necessity operator \(\square \) in terms of \(\geq \). The operator \(\geq \) provides us with an intermediate for the K-axiom, in the sense that we have both \(\square (p\rightarrow q)\rightarrow (q\geq p)\) and \((q\geq p)\rightarrow (\square p\rightarrow \square q)\). We discuss two semantics for this binary modal operator. It turns out that, as shown by Gärdenfors and Segerberg, \(\geq \) is not only too weak to distinguish finite models from infinite ones or to distinguish countable additivity from finite additivity, \(\geq \) also cannot distinguish sophisticated ways of assigning exact probabilities to events (‘measuring’) from the conceptually simpler task of just counting them.