A zero‐one law for a random subset

DOI10.1002/RSA.3240020306zbMATH Open0737.03008OpenAlexW2118539172WikidataQ115150348 ScholiaQ115150348MaRDI QIDQ3977083FDOQ3977083

Authors Peter Dolan

Publication date 25 June 1992

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.3240020306

zbMATH Keywords

zero-one lawEhrenfeucht gamefinite structurerandom relation

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) 2-person games (91A05) Combinatorial probability (60C05) Model theory of finite structures (03C13) Zero-one laws (60F20)

Recommendations

• Threshold spectra via the Ehrenfeucht game
• When Does the Zero-One Law Hold?
• scientific article; zbMATH DE number 887782
• The tenacity of zero-one laws
• Ups and downs of first order sentences on random graphs

Cites work

• Almost sure theories
• An application of games to the completeness problem for formalized theories
• Cybernetics
• Poisson approximation for large deviations
• Probabilities on finite models
• Threshold spectra via the Ehrenfeucht game
• Zero-One Laws for Sparse Random Graphs

Cited in

(6)

• scientific article; zbMATH DE number 1286037 (Why is no real title available?)
• Random graph orders do not satisfy a 0–1 law
• The complexity of random ordered structures
• Threshold spectra via the Ehrenfeucht game
• The tenacity of zero-one laws
• Zero-one laws with variable probability

This page was built for publication: A zero‐one law for a random subset

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3977083)