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