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