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