On the Very Weak 0–1 Law for Random Graphs with Orders

DOI10.1093/logcom/6.1.137zbMath0845.03012arXivmath/9507221OpenAlexW2126046713MaRDI QIDQ4870070

Saharon Shelah

Publication date: 9 May 1996

Published in: Journal of Logic and Computation (Search for Journal in Brave)

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

zbMATH Keywords

random graphszero-one lawFeferman-Vaught type theoremdistorted sum of models

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Model theory of finite structures (03C13)

Related Items (3)

Algorithmic uses of the Feferman-Vaught theorem ⋮ Non-existence of universal members in classes of abelian groups ⋮ Effective optimization with weighted automata on decomposable trees

This page was built for publication: On the Very Weak 0–1 Law for Random Graphs with Orders