Randomness and semigenericity

Details Randomness and semigenericity Randomness and semigenericity

1996-07-15

arxiv.org/abs/math/9607226v1

Trans. Amer. Math. Soc. 349 (1997), 1359-1376

Mathematics

Logic

Scientific paper

Let L contain only the equality symbol and let L^+ be an arbitrary finite symmetric relational language containing L . Suppose probabilities are defined on finite L^+ structures with ''edge probability'' n^{- alpha}. By T^alpha, the almost sure theory of random L^+-structures we mean the collection of L^+-sentences which have limit probability 1. T_alpha denotes the theory of the generic structures for K_alpha, (the collection of finite graphs G with delta_{alpha}(G)=|G|- alpha. | edges of G | hereditarily nonnegative.) THEOREM: T_alpha, the almost sure theory of random L^+-structures is the same as the theory T_alpha of the K_alpha-generic model. This theory is complete, stable, and nearly model complete. Moreover, it has the finite model property and has only infinite models so is not finitely axiomatizable.

Affiliated with

Also associated with

No associations

Rating

Randomness and semigenericity 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 Randomness and semigenericity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Randomness and semigenericity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-578051