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