Randomness and semigenericity

DOI10.1090/S0002-9947-97-01869-2MaRDI QIDQ3127255zbMATH OpenFDO

Authors John T. Baldwin, S. Shelah

Publication date 8 April 1997

Published in Transactions of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/9607226

zbMATH Keywords

0-1-lawsalmost sure theoryfinite model propertygeneric structuresnearly model completerandom graphsrandom structuresstability

Mathematics Subject Classification ID

Model theory of finite structures (03C13) Classification theory, stability, and related concepts in model theory (03C45) Random graphs (graph-theoretic aspects) (05C80)

Abstract: 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.

Recommendations

• Expansions of geometries
• Probabilities of Sentences about Very Sparse Random Graphs
• Infinitary logics and very sparse random graphs
• scientific article; zbMATH DE number 426367
• scientific article; zbMATH DE number 17685

Cites work

• On generic structures
• Probabilities of Sentences about Very Sparse Random Graphs
• Stable generic structures
• Zero-one laws for graphs with edge probabilities decaying with distance. Part I
• Zero-One Laws for Sparse Random Graphs

Cited in

(29)

• Simple generic structures
• CM-triviality and relational structures
• Model completeness of generic graphs in rational cases
• Stable generic structures
• Semi-random process without replacement
• Pseudofiniteness in Hrushovski constructions
• The theories of Baldwin-Shi hypergraphs and their atomic models
• Strict superstablity and decidability of certain generic graphs
• The metamathematics of random graphs
• A simpler axiomatization of the Shelah-Spencer almost sure theories
• Determined theories and limit laws
• Vapnik-Chervonenkis density in some theories without the independence property. I
• On rational limits of Shelah-Spencer graphs
• Expansions of geometries
• scientific article; zbMATH DE number 3856078 (Why is no real title available?)
• On generic structures with a strong amalgamation property
• Some remarks on generic structures
• Smooth classes without AC and Robinson theories
• Ample Dividing
• Notes on Quasiminimality and Excellence
• Constructing ω-stable structures: rank 2 fields
• Random \(\ell\)-colourable structures with a pregeometry
• Countable models of the theories of Baldwin-Shi hypergraphs and their regular types
• On first-order sentences without finite models
• Regularity, uniformity, and quasirandomness
• On the two kinds of probability in algebra
• Evolving Shelah‐Spencer graphs
• Ab initio generic structures which are superstable but not -stable
• Bi-colored expansions of geometric theories

This page was built for publication: Randomness and semigenericity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3127255)