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

Mathematics – Logic

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

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

     

Profile ID: LFWR-SCP-O-360480

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.