VERY WEAK ZERO-ONE LAW FOR RANDOM GRAPHS WITH ORDER AND RANDOM BINARYFUNCTIONS

Authors
SHELAH S
Citation
S. Shelah, VERY WEAK ZERO-ONE LAW FOR RANDOM GRAPHS WITH ORDER AND RANDOM BINARYFUNCTIONS, Random structures & algorithms, 9(4), 1996, pp. 351-358
Citations number
8
Categorie Soggetti
Mathematics,Mathematics,Mathematics,"Computer Science Software Graphycs Programming
Journal title
Random structures & algorithms → ACNP
ISSN journal
10429832
Volume
9
Issue
4
Year of publication
1996
Pages
351 - 358
Database
ISI
SICI code
1042-9832(1996)9:4<351:VWZLFR>2.0.ZU;2-H
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 r t and n + 1 approaches zero with n. (C) 1996 John Wiley & Sons, Inc.