A simpler axiomatization of the Shelah-Spencer almost sure theories

DOI10.1007/s11856-007-0077-8zbMath1134.03021OpenAlexW2073936131MaRDI 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

stabilityforkingsparse random graphsdimensional order propertyrelational languageslocally finite models

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Classification theory, stability, and related concepts in model theory (03C45) Models of other mathematical theories (03C65)

Related Items (8)

On rational limits of Shelah–Spencer graphs ⋮ On (uniform) hierarchical decompositions of finite structures and model-theoretic geometry ⋮ 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 ⋮ A note on stability spectrum of generic structures ⋮ COUNTABLE MODELS OF THE THEORIES OF BALDWIN–SHI HYPERGRAPHS AND THEIR REGULAR TYPES ⋮ On generic structures with a strong amalgamation property

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

This page was built for publication: A simpler axiomatization of the Shelah-Spencer almost sure theories