Very weak zero one law for random graphs with order and random binary functions

Saharon Shelah*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Scopus citations

Abstract

Natural languages and random structures are given for which there are sentences A with no limit probability, yet for every A the difference between the probabilities that A holds on random structures of sizes n and n + 1 approaches zero with n.

Original languageEnglish
Pages (from-to)351-358
Number of pages8
JournalRandom Structures and Algorithms
Volume9
Issue number4
DOIs
StatePublished - Dec 1996

Fingerprint

Dive into the research topics of 'Very weak zero one law for random graphs with order and random binary functions'. Together they form a unique fingerprint.

Cite this