星期三晚上7-9:30，锡昌堂311
教科书: David Marker, Model theory: an introduction (we will only cover the first 3 chapters)
老一代的标准教科书（也是唯一的书）是C. C. Chang & J. Keisler的Model Theory，还有Gerald Sacks的Saturated model theory以及Wilfrid Hodges, a shorter model theory. Cambridge University Press, 1997, 可以参考。
数学书到这里找：
一阶逻辑的讲义（以及更多模型论高级课程！）可以看Lou van den Dries：
http://www.math.uiuc.edu/~vddries/
有些材料我可能会在David Kazhdan的Lecture notes in Motivic Integration中找（别的讲义跟模型论没关系）
http://www.ma.huji.ac.il/~kazhdan/
Also this:
http://math.berkeley.edu/~scanlon/mn13.pdf
Homeworks
26/12/2014
Marker's book: 2.5.8-2.5.12, 2.5.14, 2.5.15
26/11/2014
Marker's book: 1.4.15, 2.5.1-2.5.4,
Please also study 2.5.18-2.5.20 (these are about ultrafilters and are optional).
06/11/2014
Marker's book: 1.4.4, 1.4.9, 1.4.10, 1.4.11
Something fun: Let x, y be two distinct points on the plane. Suppose that you have a ruler that is shorter than the distance between x and y, and that is all you have. How do you draw a line that passes through x, y? Note that you can use the ruler to extend a line segment that is already on the plane, but you cannot use it as a compass (this is a math problem, not a brain teaser!!!). The point of this problem is that of course you can use this ruler to draw a line segment anywhere on the plane, but there is no way you can determine the direction of the line (otherwise the problem is trivial).
Let DLO be the theory of "dense linear orders without endpoints". Show that any two countable models of DLO are isomorphic. (This is hard if you have not seen this sort of argument before).
19/10/2014
Marker's book: 1.4.2, 1.4.3, 1.4.8
A bipartite graph is a graph whose vertices can be divided into two disjoint sets U and V such that every edge connects a vertex in U to one in V. Write down a sentence ϕ such that every graph satisfying ϕ is a bipartite graph with 4 vertices