I believe that by "binary math" Stephen was referring to bitwise
operations, as opposed to Boolean operations in the "zero is false"
sense. Many languages have both; for instance in C and derivatives,
&& is logical AND (in which 1 && 2 == 1 because both 1 and 2 are
nonzero and therefore true) while & is bitwise AND (in which 1 & 2
== 0 because 1 and 2 have no 1-bits in common).
Since these bitwise operations are how math is accomplished in
binary, btw, I think calling them "binary math" is perfectly
reasonable.
