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