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