Exercise logic.propositional.dnf.unicode
Description
Proposition to DNF (unicode support)
Firsts
Rule | logic.propositional.idempor |
Location | [] |
Term | "Nothing" |
Focus | "Nothing" |
Environment | |
![](http://ideas.cs.uu.nl/images/external.png)
(¬(q → p) ∧ ((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬(T ∧ s)))
ready: no
Rule | logic.propositional.notnot |
Location | [1,0,0] |
Term | "Nothing" |
Focus | "Nothing" |
Environment | |
![](http://ideas.cs.uu.nl/images/external.png)
(¬(q → p) ∧ ((r ↔ s) ∨ ¬(T ∧ s))) ∨ ((q → p) ∧ ¬((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬(q → p) ∧ ((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬(T ∧ s)))
ready: no
Rule | logic.propositional.notnot |
Location | [1,1,1,0] |
Term | "Nothing" |
Focus | "Nothing" |
Environment | |
![](http://ideas.cs.uu.nl/images/external.png)
(¬(q → p) ∧ ((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬(q → p) ∧ ((r ↔ s) ∨ ¬(T ∧ s))) ∨ ((q → p) ∧ ¬((r ↔ s) ∨ ¬(T ∧ s)))
ready: no
Rule | logic.propositional.truezeroand |
Location | [0,1,1,0] |
Term | "Nothing" |
Focus | "Nothing" |
Environment | |
![](http://ideas.cs.uu.nl/images/external.png)
(¬(q → p) ∧ ((r ↔ s) ∨ ¬s)) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬(q → p) ∧ ((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬(T ∧ s)))
ready: no
Rule | logic.propositional.truezeroand |
Location | [1,0,1,0,1,0] |
Term | "Nothing" |
Focus | "Nothing" |
Environment | |
![](http://ideas.cs.uu.nl/images/external.png)
(¬(q → p) ∧ ((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬s)) ∨ (¬(q → p) ∧ ((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬(T ∧ s)))
ready: no
Rule | logic.propositional.truezeroand |
Location | [1,1,0,1,1,0] |
Term | "Nothing" |
Focus | "Nothing" |
Environment | |
![](http://ideas.cs.uu.nl/images/external.png)
(¬(q → p) ∧ ((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬(q → p) ∧ ((r ↔ s) ∨ ¬s)) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬(T ∧ s)))
ready: no
Rule | logic.propositional.truezeroand |
Location | [1,1,1,1,0,1,0] |
Term | "Nothing" |
Focus | "Nothing" |
Environment | |
![](http://ideas.cs.uu.nl/images/external.png)
(¬(q → p) ∧ ((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬(q → p) ∧ ((r ↔ s) ∨ ¬(T ∧ s))) ∨ (¬¬(q → p) ∧ ¬((r ↔ s) ∨ ¬s))
ready: no