Article thumbnail

On the very weak 0 − 1 law for random graphs with orders

By Saharon Shelah

Abstract

Abstract: Let us draw a graph R on {0, 1,..., n − 1} by having an edge {i, j} with probability p |i−j|, where ∑ i pi < ∞, and let Mn = (n, <, R). For a first order sentence ψ let an ψ be the probability of Mn | = ψ. We know that the sequence a1 ψ, a2 ψ,..., an ψ,... does not necessarily converge. But here we find a weaker substitute which we call the very weak 0-1 law. We prove that limn→∞(an ψ − an+1 ψ) = 0. For this we need a theorem on the (first order) theory of distorted sum of models

Year: 1996
DOI identifier: 10.1093/logcom/6.1.137
OAI identifier: oai:CiteSeerX.psu:10.1.1.237.177
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://arxiv.org/pdf/math/9507... (external link)

  • To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.

    Suggested articles