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