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