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

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

1995-07-15

arxiv.org/abs/math/9507221v1

J. Logic Comput. 6 (1996), 137--159

Mathematics

Logic

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

On the very weak 0-1 law for random graphs with orders does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the very weak 0-1 law for random graphs with orders, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the very weak 0-1 law for random graphs with orders will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-125768