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