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