To formalize patterns of information increase and decrease, Van Benthem (1996) proposed modal information logic ( \(\textbf{MIL}\) ), a modal logic over partial orders. In \(\textbf{MIL}\) , points are interpreted as information states and least upper bounds, when existent, as informational sums. A natural counterpart to this logic is the modal logic of minimal upper bounds ( \(\textbf{MIN}\) ), interpreting minimal, rather than least, upper bounds as informational sums. This paper presents the logic \(\textbf{MIN}\) , and in the main result, it is shown that the modal language cannot distinguish the two interpretations: a formula is valid in \(\textbf{MIN}\) if and only if it is valid in \(\textbf{MIL}\) . Leveraging the work of [11], as corollaries, an axiomatization of \(\textbf{MIN}\) and a proof of decidability are obtained.