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