Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

F ∨ ¬(((r ∧ (F ∨ r)) ∨ (¬r ∧ ¬(F ∨ r))) ∧ T ∧ r)

⇒ logic.propositional.absorpand

F ∨ ¬((r ∨ (¬r ∧ ¬(F ∨ r))) ∧ T ∧ r)

⇒ logic.propositional.falsezeroor

F ∨ ¬((r ∨ (¬r ∧ ¬r)) ∧ T ∧ r)

⇒ logic.propositional.idempand

F ∨ ¬((r ∨ ¬r) ∧ T ∧ r)

⇒ logic.propositional.complor

F ∨ ¬(T ∧ T ∧ r)