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