Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

Final term is not finished

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

⇒ logic.propositional.falsezeroor

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

⇒ logic.propositional.idempand

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

⇒ logic.propositional.truezeroand

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