Timeline for expressing a boolean function in another way
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 25, 2019 at 10:15 | comment | added | Unknown123 | Use mention feature to notify the person, else they won't notice your message in their inbox. See here: meta.stackexchange.com/questions/43019/… | |
| May 25, 2019 at 10:08 | comment | added | Unknown123 | @lightsodium you know that \$ p \Rightarrow q \equiv \neg p \vee q\$ use it altogether with DeMorgan’s laws. It's simple. | |
| May 17, 2019 at 19:16 | answer | added | Heavpoot | timeline score: 1 | |
| May 5, 2019 at 15:59 | comment | added | lightsodium | and ¬¬q = q ... | |
| May 5, 2019 at 15:59 | comment | added | lightsodium | so from g(p,q,r) = ((p -> ¬q) -> r) I can conclude : p ->r ? or ¬r ->( ¬¬ q -> ¬p)) = | |
| May 5, 2019 at 15:45 | comment | added | D.A.S. | e,g, If you know A→B, and you know ¬B, you can conclude ¬A. . . . Law of syllogism If you know A→B, and you know B→C, you can conclude A→C | |
| May 5, 2019 at 15:42 | comment | added | D.A.S. | Did you read the rules of Inference? in 2nd link | |
| May 5, 2019 at 15:40 | comment | added | lightsodium | "why not -> = →...": there is just the definition of implication | |
| May 5, 2019 at 15:33 | comment | added | D.A.S. | mypage.iu.edu/~edizquie/Q250Fall2012/Excercises/… | |
| May 5, 2019 at 15:32 | comment | added | D.A.S. | why not -> = →.... | |
| May 5, 2019 at 15:29 | comment | added | lightsodium | the link does not really help me | |
| May 5, 2019 at 15:13 | comment | added | D.A.S. | en.m.wikipedia.org/wiki/List_of_logic_symbols | |
| May 5, 2019 at 15:05 | history | asked | lightsodium | CC BY-SA 4.0 |