Zero­one laws for sentences with k variables
We consider the k variable fragment of first order logic on graphs. We claim that, for , the random graph G(n, n-α) obeys zero­one law w.r.t. this logic. Moreover, for every ε > 0 , there exists such that G(n, n-α) does not obey the law.