Zero one laws for graphs with edge probabilities decaying with distance. Part I
Saharon Shelah
math.LOarXiv:math/9606226
Abstract
Let Gn be the random graph on [n]= 1, ...,n with the possible edge i,j having probability being p|i-j|= 1/|i-j|alpha, alpha in (0,1) irrational. We prove that the zero one law (for first order logic) holds. The paper is continued in [Sh:517]
Create a lesson
Related papers
The universal measure of nonstochastic objects
Vladimir Vovk
Hyperarithmetic directions can all be exceptional for Marstrand's projection theorem
Noam Greenberg, Daniel Turetsky
Open Problems in Mathematical Logic
George Barmpalias, Su Gao, Jialiang He et al.
An easy proof that there may be no P-points
David Chodounský, Osvaldo Guzmán, Jonathan Verner
Comments on Choiceless Chain Conditions
Constance Bromham, Asaf Karagila
Localic Esakia Duality via Conic Frames
Nesta van der Schaaf