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