Zero one laws for graphs with edge probabilities decaying with distance. Part I
Saharon Shelah
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
Pseudofinite abelian groups and asymptotic classes of finite abelian groups
Carlos Cordoba-Caycedo, Dario Garcia
Spectral Theory and Descriptive Combinatorics for Non-Regular Borel pmp Graphs
Cecelia Higgins, Pieter Spaas, Sofia Torelli
The strength of the minimum principle in constructive reverse mathematics
Tatsuji Kawai
Independence of premise for intuitionistic Zermelo-Fraenkel set theory
Patrick Uftring
Condensed Whitehead Problem
Spencer Unger, Jerry Wei
Points and their multiples on curves in powers of simple abelian varieties
David J. Smith