  An asymptotic behavior of the probabilities of first-order properties of
Erdos-Renyi random graph G(N,p), lnp=-alnN, is studied in the article. We prove
the covergence law for formulae with quantifier depth bounded by k when
a=1/(k-2).
