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