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