Random sparse unary predicates

DOI10.1002/RSA.3240050302zbMath0807.03023arXivmath/9401214OpenAlexW2090259153MaRDI QIDQ4306371

Saharon Shelah, J. H. Spencer

Publication date: 5 March 1995

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

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

zbMATH Keywords

circular languagerandom unary predicates

Mathematics Subject Classification ID

Zero-one laws (60F20) Basic properties of first-order languages and structures (03C07)

Related Items (5)

The logic of ordered random structures ⋮ Convergence in homogeneous random graphs ⋮ Unnamed Item ⋮ On probabilistic elimination of generalized quantifiers ⋮ Random graph orders do not satisfy a 0–1 law

This page was built for publication: Random sparse unary predicates