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