A zero‐one law for a random subset

DOI10.1002/rsa.3240020306zbMath0737.03008OpenAlexW2118539172WikidataQ115150348 ScholiaQ115150348MaRDI QIDQ3977083

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) Zero-one laws (60F20) Model theory of finite structures (03C13)

Related Items (4)

Zero-one laws with variable probability ⋮ Unnamed Item ⋮ The complexity of random ordered structures ⋮ Random graph orders do not satisfy a 0–1 law

Cites Work

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

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