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

Saharon Shelah

doi:10.1002/(SICI)1098-2418(199612)9:4<351::AID-RSA1>3.0.CO;2-W

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

Saharon Shelah^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	351-358
Number of pages	8
Journal	Random Structures and Algorithms
Volume	9
Issue number	4
DOIs	https://doi.org/10.1002/(SICI)1098-2418(199612)9:4<351::AID-RSA1>3.0.CO;2-W
State	Published - Dec 1996

Access to Document

10.1002/(SICI)1098-2418(199612)9:4<351::AID-RSA1>3.0.CO;2-W

Cite this

@article{96166d1086374bf7b8f150b7518385ab,

title = "Very weak zero one law for random graphs with order and random binary functions",

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.",

author = "Saharon Shelah",

year = "1996",

month = dec,

doi = "10.1002/(SICI)1098-2418(199612)9:4<351::AID-RSA1>3.0.CO;2-W",

language = "אנגלית",

volume = "9",

pages = "351--358",

journal = "Random Structures and Algorithms",

issn = "1042-9832",

publisher = "John Wiley and Sons Ltd",

number = "4",

}

TY - JOUR

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

AU - Shelah, Saharon

PY - 1996/12

Y1 - 1996/12

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0030510939

U2 - 10.1002/(SICI)1098-2418(199612)9:4<351::AID-RSA1>3.0.CO;2-W

DO - 10.1002/(SICI)1098-2418(199612)9:4<351::AID-RSA1>3.0.CO;2-W

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0030510939

SN - 1042-9832

VL - 9

SP - 351

EP - 358

JO - Random Structures and Algorithms

JF - Random Structures and Algorithms

IS - 4

ER -

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

Abstract

Access to Document

Other files and links

Fingerprint

Cite this