The Gärdenfors impossibility theorem in non-monotonic contexts (Q917540)

The Ramsey test says that a conditional sentence ``if A, then C'', is accepted in a state of belief K if and only if the minimal change of K needed to accept A also requires accepting C. Gärdenfors' impossibility theorem shows that the Ramsey test cannot be combined with some other weak conditions on belief revisions. The present note shows that a version of the impossibility theorem still can be proved even if the underlying logic is assumed to be nonmonotonic instead of classical.