Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth
Zero-One Laws for Existential First-Order Sentences of Bounded Quantifier Depth
For any fixed positive integer k , let α k denote the smallest α ∈ (0,1) such that the random graph sequence { G ( n, n -α )} n does not satisfy the zero-one law for the set ε k of all existential first-order sentences that are of quantifier …