- #1
ollieha
- 1
- 0
- TL;DR Summary
- Need help solving algorithm for truth
I have an equation that I need some serious help with. I’m using a “not such that”, and I don’t know if the critical component (x ¬ | ∃x) is solvable!
Well here it is:
(x ¬ | ∃x) = ∅ ⊕ {∅}) ⊕ ∅
So if x exists independently from the reference of x, the first bit is true, but is there ever a time when that is the case?
So confused-
Oliver
Well here it is:
(x ¬ | ∃x) = ∅ ⊕ {∅}) ⊕ ∅
So if x exists independently from the reference of x, the first bit is true, but is there ever a time when that is the case?
So confused-
Oliver
