3 ms·
I played with the idea of "complex booleans", but it didn't work very well. The idea was, just as in a complex number you have a + i b, let a "boolean" be a +
by AnimalMuppet 7y ago
I played with the idea of "complex booleans", but it didn't work very well. The idea was, just as in a complex number you have a + i b, let a "boolean" be a + i b, where a and be are either true or false.
But the problem is, if you set true = 1 and false = 0, and then use multiplication for "and", then (true + i true) and (true + i true) = (1 + i) * (1 + i) = (1 + i + i - 1) = (0 + 2 i), which is not a valid answer. So this "logic" didn't have as many nice algebraic properties as boolean logic.
- tempguy9999 7y agoin {1, 0} representing true/false respectively, * is often used for 'and', and + for 'or'. So there may be a good interpretation if you can sort out what the plus sign in x+iy means - is it an 'or', or something else? Good luck!
- abecedarius 7y agoBoole himself used '+' for 'or', but restricted himself as to when he was allowed to do it (i.e. there was no "true or true = true"; iirc it was Peirce and maybe others who came up with that).
- deleted 7y ago[deleted]
- obastani 7y agoOne idea would be to let {0, 1} be the integers mod 2. Then, AND is multiplication (i.e., a AND b = a b, since a b = 1 iff a = b = 1), NOT is inversion (i.e., NOT a = 1 - a), and OR follows from the previous two definitions (i.e., a OR b = 1 - (1 - a) (1 - b) = a + b - a b). To get complex values, we can consider the Gaussian integers [1] mod 2. Then, we have (1 + i) (1 + i) = (1 + i + i - 1) = 0 + 2 i = 0. So these integers are a ring where there are nonzero elements that multiply to 0. [1] https://en.wikipedia.org/wiki/Gaussian_integer https://en.wikipedia.org/wiki/Gaussian_integer
- carapace 7y agoGeorge Spencer Brown talks about imaginary Boolean values in "Laws of Form".