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