On the law [p boolean AND q -> r] = [(p -> r) boolean OR (q -> r)] in fuzzy logic
This paper deals with the logical equivalence of Classical Propositional Calculus appearing in its title. This equality seems to play a central role in a recent discussion around a paper or Combs and Andrews. After reconsidering the equivalence in lattices, its validity in the Standard Theories of Fuzzy Sets endowed with an Implication Operator is studied.
implication and conditional laws of fuzzy logic