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