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