"Given an undirected graph, is it triangle-free? Does it have isolated vertices? These are the kind of questions that can be formulated using first order logic (FOL). An FOL formula evaluates to either true or false on a graph. The zero-one law for FOL says that every FOL formula either evaluates to true on ""almost"" all graphs, or evaluates to false on ""almost"" all of them. The talk will be a gentle introduction to FOL followed by a proof-sketch of the zero-one law. "