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