 when \(P(C|A)&gt;P(C)\), and defined to be equal to \(0\) otherwise. This yields a modified score of “uncertainty” for a conditional, which they substitute for the standard notion of uncertainty in Adams’s definition of \(p\)-validity. The logic they identify violates RW and Cut, but it validates AND, CMon, OR, Modus Ponens, restricted forms of Aristotle’s and Abelard’s theses (principles of connexive logic), and even Contraposition. Crupi and Iacona (forthcoming-a) present a possible-worlds semantics for what appears to be the same logic, in which contraposition plays a central role.