Sh:463

• Shelah, S. (1996). On the very weak 0-1 law for random graphs with orders. J. Logic Comput., 6(1), 137–159. arXiv: math/9507221 DOI: 10.1093/logcom/6.1.137 MR: 1376723
• Abstract:
  Let us draw a graph R on 0,1,...,n-1 by having an edge i,j with probability p_(|i-j|), where \sum_i p_i is finite and let M_n=(n,<,R). For a first order sentence \psi let a^n_\psi be the probability of "M_n satisfies \psi". We prove that the limit of a^n_\psi-a^{n+1}_\psi is 0, as n goes to infinity.
• Version 2008-10-30_10 (30p) published version (23p)

@article{Sh:463,
 author = {Shelah, Saharon},
 title = {{On the very weak 0-1 law for random graphs with orders}},
 journal = {J. Logic Comput.},
 fjournal = {Journal of Logic and Computation},
 volume = {6},
 number = {1},
 year = {1996},
 pages = {137--159},
 issn = {0955-792X},
 mrnumber = {1376723},
 mrclass = {05C80 (03C13)},
 doi = {10.1093/logcom/6.1.137},
 note = {\href{https://arxiv.org/abs/math/9507221}{arXiv: math/9507221}},
 arxiv_number = {math/9507221}
}