Timeline for Is following function a metric on the set of isomorphism classes of graphs with countably many vertices?
Current License: CC BY-SA 4.0
7 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Dec 18, 2019 at 15:20 | history | edited | Chain Markov | CC BY-SA 4.0 |
added 49 characters in body
|
| Dec 18, 2019 at 14:24 | comment | added | Joel David Hamkins | That situation doesn't arise with Ehrenfeucht-Fraisse games, however, but I have to think about your variation. | |
| Dec 18, 2019 at 14:23 | comment | added | Joel David Hamkins | "Game lasting indefinitely" is not necessarily the same as "game not definitely winnable at finite stage" in general. For example, in infinite chess, there are positions that are a win for white, but not mate-in-n for any finite n. See mathoverflow.net/a/86755/1946. | |
| Dec 18, 2019 at 14:14 | vote | accept | Chain Markov | ||
| Dec 18, 2019 at 14:08 | answer | added | Joel David Hamkins | timeline score: 3 | |
| Dec 18, 2019 at 13:22 | comment | added | LeechLattice | Are there evidence supporting (or against) the claim that $d(Γ_1,Γ_2)≤\max (d(Γ_1,Γ_3),d(Γ_2,Γ_3))$? | |
| Dec 18, 2019 at 11:39 | history | asked | Chain Markov | CC BY-SA 4.0 |