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