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