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