Randomness and semigenericity
From MaRDI portal
Publication:3127255
DOI10.1090/S0002-9947-97-01869-2zbMath0952.03029arXivmath/9607226MaRDI QIDQ3127255
John T. Baldwin, Saharon 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
stabilityrandom graphsfinite model propertyalmost sure theoryrandom structuresgeneric structures0-1-lawsnearly model complete
Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13) Classification theory, stability, and related concepts in model theory (03C45)
Related Items (23)
Expansions of geometries ⋮ On rational limits of Shelah–Spencer graphs ⋮ On first-order sentences without finite models ⋮ Stable generic structures ⋮ Pseudofiniteness in Hrushovski constructions ⋮ Evolving Shelah‐Spencer graphs ⋮ Simple generic structures ⋮ CM-triviality and relational structures ⋮ The metamathematics of random graphs ⋮ Ab initio generic structures which are superstable but not \(\omega \)-stable ⋮ The theories of Baldwin-Shi hypergraphs and their atomic models ⋮ Ample Dividing ⋮ Model completeness of generic graphs in rational cases ⋮ A simpler axiomatization of the Shelah-Spencer almost sure theories ⋮ Notes on Quasiminimality and Excellence ⋮ Determined theories and limit laws ⋮ COUNTABLE MODELS OF THE THEORIES OF BALDWIN–SHI HYPERGRAPHS AND THEIR REGULAR TYPES ⋮ Vapnik-Chervonenkis density in some theories without the independence property, I ⋮ Constructing ω-stable structures: rank 2 fields ⋮ Smooth classes without AC and Robinson theories ⋮ On generic structures with a strong amalgamation property ⋮ Some remarks on generic structures ⋮ Strict superstablity and decidability of certain generic graphs
Cites Work
This page was built for publication: Randomness and semigenericity
