The metamathematics of random graphs
From MaRDI portal
Publication:2433743
DOI10.1016/j.apal.2006.01.006zbMath1112.03022OpenAlexW2074606866MaRDI QIDQ2433743
Publication date: 30 October 2006
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apal.2006.01.006
Urysohn space0-1 lawdetermined theoriesfinite and infinite model theorylimit laws on finite probability spacesprobability and logic
Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13) Classification theory, stability, and related concepts in model theory (03C45) Abstract model theory (03C95)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ramsey quantifiers and the finite cover property
- Infinitary logics and 0-1 laws
- Model companions of \(T_{\Aut}\) for stable \(T\)
- Constructing \(\omega\)-stable structures: Model completeness.
- A simpler axiomatization of the Shelah-Spencer almost sure theories
- Determined theories and limit laws
- A remark on the stability of saturated generic graphs
- Paires de structures stables
- Randomness and semigenericity
- Almost Everywhere Equivalence of Logics in Finite Model Theory
- Expansions of geometries
- Zero-One Laws for Sparse Random Graphs
- Probabilities on finite models
- DOP and FCP in generic structures
- Transfering saturation, the finite cover property, and stability
- Stability, the finite cover property and 0-1 laws
- Random metric spaces and universality
- Ultraproducts which are not saturated
This page was built for publication: The metamathematics of random graphs
