In the random graph G(n, p), p = n−a: If ψ has probability O(n−ε) for every ε > 0 then it has probability O(e−nε) for some ε > 0

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

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/0168-0072(95)00071-2

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,031

External links

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

Through your library

My notes

Similar books and articles

In the random graph G(n, p), p = n−a: If ψ has probability O(n−ε) for every ε > 0 then it has probability O(e−nε) for some ε > 0. [REVIEW]Saharon Shelah - 1996 - Annals of Pure and Applied Logic 82 (1):97-102.
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. [REVIEW]Saharon Shelah - 1996 - Annals of Pure and Applied Logic 82 (1):97-102.
Computability and convergence.Jeremy Avigad - unknown
Infinitary logics and very sparse random graphs.James F. Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
The undecidability of k-provability.Samuel Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.
The undecidability of k-provability.Samuel R. Buss - 1991 - Annals of Pure and Applied Logic 53 (1):75-102.
Infinitary Logics and Very Sparse Random Graphs.James Lynch - 1997 - Journal of Symbolic Logic 62 (2):609-623.
On p-reducibility of numerations.A. N. Degtev - 1993 - Annals of Pure and Applied Logic 63 (1):57-60.
Enumerators of lambda terms are reducing constructively.Henk Barendregt - 1995 - Annals of Pure and Applied Logic 73 (1):3-9.
Partial orderings with the weak Freese-Nation property.Sakaé Fuchino, Sabine Koppelberg & Saharon Shelah - 1996 - Annals of Pure and Applied Logic 80 (1):35-54.

Analytics

Added to PP
2014-01-16

Downloads
13 (#1,065,206)

6 months
3 (#1,046,495)

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