A simpler axiomatization of the Shelah-Spencer almost sure theories

DOI10.1007/s11856-007-0077-8zbMath1134.03021MaRDI QIDQ2480589

Michael Chris Laskowski

Publication date: 1 April 2008

Published in: Israel Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11856-007-0077-8

zbMATH Keywords

stability; forking; sparse random graphs; dimensional order property; relational languages; locally finite models

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

03C45: Classification theory, stability, and related concepts in model theory

03C65: Models of other mathematical theories

Related Items

COUNTABLE MODELS OF THE THEORIES OF BALDWIN–SHI HYPERGRAPHS AND THEIR REGULAR TYPES, On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry, Ab initio generic structures which are superstable but not \(\omega \)-stable, The theories of Baldwin-Shi hypergraphs and their atomic models, The metamathematics of random graphs, On rational limits of Shelah–Spencer graphs, On generic structures with a strong amalgamation property, A note on stability spectrum of generic structures

Cites Work

• Unnamed Item
• Unnamed Item
• Stable generic structures
• A remark on the stability of saturated generic graphs
• Randomness and semigenericity
• Zero-One Laws for Sparse Random Graphs
• DOP and FCP in generic structures
• The strange logic of random graphs