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