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