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