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