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