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