Timeline for Which graphs are elementarily equivalent to their own disjoint sums?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Mar 26, 2024 at 12:36 | history | suggested | The Amplitwist | CC BY-SA 4.0 | fixed broken link to Wikipedia |
| Mar 26, 2024 at 12:05 | review | Suggested edits | |||
| S Mar 26, 2024 at 12:36 | |||||
| Sep 3, 2010 at 23:04 | comment | added | John Goodrick | @Joel: OK, I just inserted a parenthetical comment into the answer explaining that part. | |
| Sep 3, 2010 at 23:03 | history | edited | John Goodrick | CC BY-SA 2.5 | Inserted parenthetical comment in Part I to address Joel's question. |
| Sep 3, 2010 at 22:28 | comment | added | Joel David Hamkins | Regarding your edit, could you explain the step from $m$-self-similarity to $m^k$-self-similarity? | |
| Sep 3, 2010 at 20:24 | history | edited | John Goodrick | CC BY-SA 2.5 | Added "Part I" to the answer. |
| Sep 2, 2010 at 0:08 | comment | added | Joel David Hamkins | I note also that this example continues the pattern of the graph examples for which $2$-self-smilarity is equivalent to $\delta$-self-similarity for any (and/or every) $\delta$. | |
| Sep 1, 2010 at 15:31 | history | answered | John Goodrick | CC BY-SA 2.5 |