Function for identifying valid applications of DeMorgan's Rule at the top level. DeMorgan's Rule is a Rule of Equivalence. It is used for transforming a negated conjunction/disjunction into a disjunction/conjunction of negations (and vice versa). E.g.: (1) ~(p & q); (2) ~p V ~q.
To identify this rule (at the top level), we observe that one of the arguments must start with a negation, and the other must either be a conjunction or a disjunction. Once we have done this, it is easy to check whether the operands of the conjunction/disjunction are the negations of the operands of the negation's inner formula.
Generated using TypeDoc
Function for checking whether DeMorgan's Rule applies recursively.