Exercise logic.propositional.cnf.unicode

Description
Proposition to CNF (unicode support)

Derivation

¬(r ↔ r) ∨ ¬(T ∧ r ∧ (r ↔ r)) ∨ ¬T ∨ ¬r
logic.propositional.nottrue
¬(r ↔ r) ∨ ¬(T ∧ r ∧ (r ↔ r)) ∨ F ∨ ¬r
logic.propositional.falsezeroor
¬(r ↔ r) ∨ ¬(T ∧ r ∧ (r ↔ r)) ∨ ¬r
logic.propositional.truezeroand
¬(r ↔ r) ∨ ¬(r ∧ (r ↔ r)) ∨ ¬r
logic.propositional.defequiv
¬((r ∧ r) ∨ (¬r ∧ ¬r)) ∨ ¬(r ∧ (r ↔ r)) ∨ ¬r
logic.propositional.idempand
¬(r ∨ (¬r ∧ ¬r)) ∨ ¬(r ∧ (r ↔ r)) ∨ ¬r
logic.propositional.idempand
¬(r ∨ ¬r) ∨ ¬(r ∧ (r ↔ r)) ∨ ¬r
logic.propositional.complor
¬T ∨ ¬(r ∧ (r ↔ r)) ∨ ¬r
logic.propositional.nottrue
F ∨ ¬(r ∧ (r ↔ r)) ∨ ¬r
logic.propositional.falsezeroor
¬(r ∧ (r ↔ r)) ∨ ¬r
logic.propositional.defequiv
¬(r ∧ ((r ∧ r) ∨ (¬r ∧ ¬r))) ∨ ¬r
logic.propositional.idempand
¬(r ∧ (r ∨ (¬r ∧ ¬r))) ∨ ¬r
logic.propositional.absorpand
¬r ∨ ¬r
logic.propositional.idempor
¬r