Very weak zero one law for random graphs with order and random binary functions

Details Very weak zero one law for random graphs with order and random binary functions Very weak zero one law for random graphs with order and random binary functions

1996-06-15

arxiv.org/abs/math/9606230v1

Random Structures Algorithms 9 (1996), 351-358

Mathematics

Logic

Scientific paper

Let G_<(n,p) denote the usual random graph G(n,p) on a totally ordered set of n vertices. We will fix p=1/2 for definiteness. Let L^< denote the first order language with predicates equality (x=y), adjacency (x~y) and less than (x infty}(f_A(n+1)-f_A(n))=0.

Affiliated with

Also associated with

No associations

Rating

Very weak zero one law for random graphs with order and random binary functions 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 Very weak zero one law for random graphs with order and random binary functions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Very weak zero one law for random graphs with order and random binary functions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-360480