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