Languages have more bitwise functions than we think..
Let all the bitwise operations be represented by a number from 0 to 15, where the most significant bit is f(F,F), and then f(F,T), then f(T,F), lastly f(T,T).
"and" would be 0001, "or" would be 0111
and = &, *
or = |, + (in some langs)
xor = !=
xnor = ==
0010 = >
0100 = <
implies (1011) = >=
1101 = <=