Completeness and incompleteness for plausibility logic (Q1923829)

Plausibility Logic was introduced by D. Lehmann as a sequent calculus in a propositional language without connectives. As such a system it satisfies Inclusion, Right Monotony, Cautious Left Monotony and Cautious Cut. In this paper first it is proved that in fact Right Monotony can be treated as an axiom. Furthermore, Cautious Cut cannot be replaced by its unit form without weakening the system. Then the connection between Plausibility Logic and Minimal Preferential Models is studied. It turns out that the subsystem based on Inclusion+Right Monotony+Cautious Cut is sound and complete for Minimal Preferential Models, but that on the other hand, the full system is not complete for smooth Minimal Preferential Models.