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