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