Übersicht | Exercises | Slides |
16.07.2013 | As some have realised (congratulations), there was a mistake in Exercise 12.6 (c), which has just been corrected. We do have the means to show MSO-non-definbaility of the graph of addition over ([n],<), namely? |
Name | Raum | Tel. |
---|---|---|
Otto, Martin | S2|15 207 | 22861 |
Eickmeyer, Kord | S2|15 204 | 22864 |