Couldn’t the implication sign “→” in A→B be viewed as a morphism between A and B? Also, could mathematical operators like plus, minus, AND, OR, etc. be viewed as morphisms?
The implication sign “→” in A→B is a morphism from Bool x Bool to Bool (where "Bool" is the set of Boolean values).
Similarly, pretty much ANY binary operator can be regarded that way as long as the sets involved are defined carefully (for instance, "/" works on R x (R - {0}) since it's not defined for the second argument zero)
1 comment
[ 3.0 ms ] story [ 12.3 ms ] threadSimilarly, pretty much ANY binary operator can be regarded that way as long as the sets involved are defined carefully (for instance, "/" works on R x (R - {0}) since it's not defined for the second argument zero)