Timeline for How are Modal Logic and Graph Theory related?
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Feb 4, 2013 at 18:19 | comment | added | Joel David Hamkins | Thanks, Emil, I have inserted "finite", and this is indeed how we define it in the paper. This logic seems to be related to the modal logic of class forcing, and also curiously of c.c.c. forcing, but we can't yet settle either case exactly. | |
| Feb 4, 2013 at 18:16 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
added 159 characters in body
|
| Feb 4, 2013 at 15:52 | comment | added | Emil Jeřábek | +1 for the unexpected appearance of Medvedev’s logic. (A minor quibble: since ML is not known to [and seems not to] coincide with the logic of arbitrary topless Boolean algebras, this applies to S4.tBA as well. That is, you shouldn’t drop “finite” from the definition.) | |
| Feb 3, 2013 at 21:21 | history | edited | Joel David Hamkins | CC BY-SA 3.0 |
improved formating; added 2 characters in body
|
| Feb 3, 2013 at 21:10 | history | answered | Joel David Hamkins | CC BY-SA 3.0 |