Infinitary logics and very sparse random graphs

The infinitary language obtained from the first-order language of graphs by closure under conjunctions and disjunctions of arbitrary sets of formulas, provided only finitely many distinct variables occur among the formulas, is considered. Let p(n) be the edge probability of the random graph on n vertices. It is shown that if p(n)<1, then the probability is either smaller than 2 raised to the power-n/sup d/ for some d>0, or it is asymptotic to the cn/sup -d/ for some c>0, d>or=0. Results on the difficulty of computing the asymptotic probability are given.<>