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