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