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