Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Derivation
![](http://ideas.cs.uu.nl/images/external.png)
((F ∨ ¬(q → p)) ∧ (F ∨ ¬(q → p))) ↔ (((r ↔ s) ∨ ¬s) ∧ T)
⇒ logic.propositional.truezeroand((F ∨ ¬(q → p)) ∧ (F ∨ ¬(q → p))) ↔ ((r ↔ s) ∨ ¬s)
⇒ logic.propositional.defequiv((F ∨ ¬(q → p)) ∧ (F ∨ ¬(q → p))) ↔ ((r ∧ s) ∨ (¬r ∧ ¬s) ∨ ¬s)
⇒ logic.propositional.absorpor((F ∨ ¬(q → p)) ∧ (F ∨ ¬(q → p))) ↔ ((r ∧ s) ∨ ¬s)