long complicated poll, you will not be paid for this
@georgia@dickkickextremist.xyz well, the vector operations don't really fit a truth table, but I can give an example with just 2 elements:
With first operand being (true | false), second - (false | true), here is what each operation would do:
1. reduce both vector with disjunction
for first: true | false = true
for second: false | true = true
return the conjunction:
true & true = true
2. this one is equivalent of algebraic/symbolic expansion:
(true | false) & (true | false) =
(true & true) | (true & false) | (false & true) | (false & false)
except that it also performs the conjunctions to get a matrix/vector that still represents a disjunction:
(true | false |
false | false)
this is the final result, no further reduction.
3. conjunction of first elements of the first and second operands:
true & false = false
onjunction of second elements of the operands:
false & true = false
and final result just a vector/list that no longer represents a disjunction:
(false, false)
... I just realized, I won't be paid for this either ._.