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