Timeline for Schröder and graphical logic?
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 27, 2023 at 23:48 | history | undeleted | Tom Copeland | ||
| May 27, 2023 at 20:43 | history | rollback | Stefan Kohl♦ |
Rollback to Revision 5
|
|
| Jul 11, 2021 at 5:29 | history | deleted | Tom Copeland | via Vote | |
| Jul 11, 2021 at 5:29 | history | edited | Tom Copeland | CC BY-SA 4.0 |
deleted 8961 characters in body
|
| Jul 10, 2021 at 21:03 | history | edited | Tom Copeland | CC BY-SA 4.0 |
more notes on overlapping interests of Cayley and Schröder
|
| Jul 9, 2021 at 20:12 | comment | added | Alex Kruckman | I'm not sure exactly what's meant by "diagrammatics" here. Schröder is famous for taking a very algebraic approach to logic, which would suggest that diagrams did not play a major role in his work. Anyway, isn't this question better suited for HSM? | |
| Jul 9, 2021 at 18:50 | history | edited | Tom Copeland | CC BY-SA 4.0 |
Corrected link
|
| Jul 9, 2021 at 18:32 | comment | added | Tom Copeland | @SamHopkins, just as Babbage, Boole, Gödel, Russell, Whitehead, and Turing are not typically associated with combinatorics, neither are Euler, Comtet, Riordan, and Carlitz typically associated with ML. Schröder and Cayley ("Note on the calculus of logic") are exceptional in making significant contributions to both, but most discussions of their works lean toward one field or the other, hence the surprise when one working primarily in one field or the other finds out about their contributions to both. | |
| Jul 9, 2021 at 7:26 | comment | added | Gerry Myerson | "Exceeds a million" makes me think of $2^{20}=1,048,576$. That would be the number of compound propositions you could make from ten simple propositions, if the idea is that for each simple proposition you have to choose either that proposition or its negation. | |
| Jul 8, 2021 at 20:37 | history | edited | Tom Copeland | CC BY-SA 4.0 |
Addressing a comment
|
| Jul 8, 2021 at 20:31 | history | edited | Tom Copeland | CC BY-SA 4.0 |
Addressing a comment
|
| Jul 8, 2021 at 19:05 | comment | added | Sam Hopkins | I'm a bit confused by your question: to me it is not surprising at all that logicians would consider various sorts of bracketing problems, precisely because they have direct bearing on how many different sentences of given length we can form in various logical systems. | |
| Jul 8, 2021 at 18:54 | history | asked | Tom Copeland | CC BY-SA 4.0 |