Exercise logic.propositional.cnf.unicode
Description
Proposition to CNF (unicode support)
Derivation
Final term is not finished
¬(r ↔ r) ∨ (¬¬(F ∨ ¬r) ∧ (F ∨ ¬r))
⇒ logic.propositional.notnot¬(r ↔ r) ∨ ((F ∨ ¬r) ∧ (F ∨ ¬r))
⇒ logic.propositional.falsezeroor¬(r ↔ r) ∨ (¬r ∧ (F ∨ ¬r))