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