Hereditary Zero-One Laws for Graphs

  • Saharon Shelah
  • Mor Doron
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6300)


We consider the random graph \(M^n_{\bar{p}}\) on the set [n], where the probability of {x,y} being an edge is p|x − y|, and \(\bar{p}=(p_1,p_2,p_3,...)\) is a series of probabilities. We consider the set of all \(\bar{q}\) derived from \(\bar{p}\) by inserting 0 probabilities into \(\bar{p}\), or alternatively by decreasing some of the p i . We say that \(\bar{p}\) hereditarily satisfies the 0-1 law if the 0-1 law (for first order logic) holds in \(M^n_{\bar{q}}\) for every \(\bar{q}\) derived from \(\bar{p}\) in the relevant way described above. We give a necessary and sufficient condition on \(\bar{p}\) for it to hereditarily satisfy the 0-1 law.


random graphs zero-one laws 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Gaifman, H.: On local and nonlocal properties. In: Proceedings of the Herbrand symposium (Marseilles, 1981). Stud. Logic Found. Math., vol. 107, pp. 105–135. North-Holland, Amsterdam (1982)Google Scholar
  2. 2.
    Łuczak, T., Shelah, S.: Convergence in homogeneous random graphs. Random Structures Algorithms 6(4), 371–391 (1995)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Shelah, S.: Hereditary convergence laws with successor (in preparation)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Saharon Shelah
    • 1
  • Mor Doron
    • 1
  1. 1.Department of MathematicsThe Hebrew University of JerusalemIsrael

Personalised recommendations