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