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