Simplification logic, a logic for attribute implications, was originally defined for Boolean sets. It was extended to distributive fuzzy sets by using a complete dual Heyting algebra. In this paper, we weaken this restriction in the sense that we prove that it is possible to define a simplification logic on fuzzy sets in which the membership value structure is not necessarily distributive. For this purpose, we replace the structure of the complete dual Heyting algebra by the so-called weak complete dual Heyting algebra. We demonstrate the soundness and completeness of this simplification logic, and provide a characterisation of the operations defining weak complete dual Heyting algebras.
