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