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