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