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