Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.truezeroand

F ∨ ¬((r ↔ (r ∨ r)) ∧ r)