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