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