Failure of 0-1 law for sparse random graph in strong logics (Sh1062)
Saharon Shelah · 2017
Let α∈ (0; 1) R be irrational and G n = G n ; 1/nα be the random graph on [ n ] with edge probability 1/nα ; we know that it satisfies the 0-1 law for first order logic. We deal with the failure of the 0-1 law for stronger logics: L ∞;k ; k large enough and the LFP, least fixed point logic.