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