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