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