Logical properties of random graphs
First order expressible properties have been studied using random finite models. That is, by looking on the possible behavior of first order properties given a probability space of graphs, e.g., G(n,p). A number of very attractive and surprising results have been obtained along the years. In the talk I'll mention some of the classic results, demonstrate proof techniques and present two new results and a few open problems. No knowledge of logic is assumed.