In the random graph< i> G(< i> n,< i> p_),< i> p_=< i> n_< sup>− a: If ψ has probability< i> O_(< i> n_< sup>− ε) for every< i> ε_> 0 then it has probability< i> O_(< i> e_< sup>− nε) for some< i> ε_> 0 [Book Review]

Annals of Pure and Applied Logic 82 (1):97-102 (1996)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,349

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Infinitary logics and very sparse random graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
On some peculiarities of quantum mechanics.L. S. Mayants - 1977 - Foundations of Physics 7 (1-2):3-28.
A Theistic Conception of Probability.Richard Otte - 1987 - Faith and Philosophy 4 (4):427-447.
A Probability Path.Sidney Resnick - 1998 - Birkhäuser Boston.
When can statistical theories be causally closed?Balázs Gyenis & Miklós Rédei - 2002 - Foundations of Physics 34 (9):1285-1303.

Analytics

Added to PP
2014-03-25

Downloads
20 (#744,405)

6 months
1 (#1,533,009)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Fixed-point extensions of first-order logic.Yuri Gurevich & Saharon Shelah - 1986 - Annals of Pure and Applied Logic 32:265-280.

Add more references