First-order zero-one law for the uniform model of the random graph

DOI10.1070/SM9321zbMath1448.05184OpenAlexW3025528031WikidataQ114849610 ScholiaQ114849610MaRDI QIDQ5122439

M. E. Zhukovskii, N. M. Sveshnikov

Publication date: 22 September 2020

Published in: Sbornik: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/sm9321

zbMATH Keywords

first-order logiczero-one lawuniform model of the random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Zero-one laws (60F20) Model theory of finite structures (03C13)

Related Items (2)

MSO 0-1 law for recursive random trees ⋮ \(\gamma\)-variable first-order logic of uniform attachment random graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Counting extensions
• An application of games to the completeness problem for formalized theories
• Zero-One Laws for Sparse Random Graphs
• Strongly balanced graphs and random graphs
• Threshold functions for small subgraphs
• Probabilities on finite models
• Random graphs: models and asymptotic characteristics
• The strange logic of random graphs

This page was built for publication: First-order zero-one law for the uniform model of the random graph