Premium
Very weak zero one law for random graphs with order and random binary functions
Author(s) -
Shelah Saharon
Publication year - 1996
Publication title -
random structures and algorithms
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.314
H-Index - 69
eISSN - 1098-2418
pISSN - 1042-9832
DOI - 10.1002/(sici)1098-2418(199612)9:4<351::aid-rsa1>3.0.co;2-w
Subject(s) - struct , zero (linguistics) , random graph , mathematics , limit (mathematics) , binary number , discrete mathematics , combinatorics , order (exchange) , random element , random variable , statistical physics , statistics , computer science , physics , mathematical analysis , philosophy , linguistics , arithmetic , graph , economics , finance , programming language
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. © 1996 John Wiley & Sons, Inc. Random Struct. Alg. , 9, 351–358 (1996)