Timeline for Non-definability of graph 3-colorability in first-order logic
Current License: CC BY-SA 4.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| S Jul 26, 2023 at 23:08 | history | suggested | 8bc3 457f | CC BY-SA 4.0 |
Insert some missing words and spaces.
|
| Jul 26, 2023 at 21:59 | review | Suggested edits | |||
| S Jul 26, 2023 at 23:08 | |||||
| Jul 22, 2023 at 6:22 | comment | added | Emil Jeřábek | It’s actually quite easy to write down explicit axioms of $T_n$: it will consist of the universal sentences expressing “I do not contain a copy of $G$” for each finite graph $G$ that is not $n$-colourable. This follows immediately from the compactness theorem, no need to use Keisler–Shelah. | |
| Jul 22, 2023 at 3:11 | history | answered | Will Boney | CC BY-SA 4.0 |