Zero-one laws for k-variable first-order logic of sparse random graphs

A. S. Razafimahatratra, M. Zhukovskii

In this paper, we prove that for every positive $\epsilon$, there exists an $\alpha \in (1/(k-1),1/(k-1)+\epsilon )$ such that the binomial random graph $G(n,n^{-\alpha })$ does not obey 0…