Timeline for Why is the + sign commonly used as logic OR operator?
Current License: CC BY-SA 3.0
17 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 2, 2014 at 0:44 | answer | added | david | timeline score: 3 | |
| Oct 1, 2014 at 6:36 | vote | accept | Rev | ||
| Sep 30, 2014 at 19:08 | comment | added | barlop | Could it be that while keyboards have a V, it's the letter V not a special V for or, and they don't have an upside down V, for AND. Maybe if keyboards had keys for those or even just for OR , then they wouldn't use + | |
| Sep 30, 2014 at 15:28 | comment | added | The Photon | @immibis I didn't say that OR and addition are identical operations. I said that 0 is the identity for both operations. | |
| Sep 30, 2014 at 13:30 | comment | added | Phyllostachys | In boolean algebra, the symbol 1 doesn't represent "one of something". | |
| Sep 30, 2014 at 7:36 | comment | added | Criticizing Israel not allowed | @ThePhoton 1+1≠1 | |
| Sep 29, 2014 at 22:04 | answer | added | Tobias Hagge | timeline score: 5 | |
| Sep 29, 2014 at 21:40 | history | tweeted | twitter.com/#!/StackElectronix/status/516703992307789824 | ||
| Sep 29, 2014 at 21:27 | comment | added | Tobias Hagge | In some sense + would be better used as the exclusive-or operator, since with AND as the multiplicative operator one obtains an algebra (in the sense of an algebra over a field) over F_2. The sum-and-product notation is used in lattice theory texts to represent meets and joins (of which, AND and OR are examples in a boolean lattice); the notation might possibly have its origins in universal algebra. In the end, the choice may amount to nothing more than the convenience of being able to write products as concatenated strings rather than having to write the binary operator explicitly. | |
| Sep 29, 2014 at 21:09 | answer | added | vsz | timeline score: 20 | |
| Sep 29, 2014 at 20:02 | comment | added | The Photon | More theoretically, 0 is the additive identity for the integers, and 0 is also the identity value for the OR operation on the boolean value set. (Apologies to any mathematicians if I've abused your jargon) | |
| Sep 29, 2014 at 20:00 | comment | added | The Photon | 0*1 = 0 and 0 AND 1 = 0. 0+1 = 1 and 0 OR 1 = 1. | |
| Sep 29, 2014 at 19:37 | history | edited | Rev | CC BY-SA 3.0 |
minor
|
| Sep 29, 2014 at 19:19 | answer | added | AndrejaKo | timeline score: 21 | |
| Sep 29, 2014 at 19:19 | comment | added | Tut | Perhaps because in binary logic evaluation, any non-zero result would be considered "1", then "sum" would be correct. | |
| Sep 29, 2014 at 19:15 | comment | added | Majenko | OR is akin to PLUS in "normal" mathematics. AND is akin to MULTIPLY, so the · operator is used. | |
| Sep 29, 2014 at 19:09 | history | asked | Rev | CC BY-SA 3.0 |