# Zero-one laws for existential first order sentences of bounded quantifier depth

## TL;DR

This paper investigates the thresholds for zero-one laws in random graphs concerning existential first order sentences with bounded quantifier depth, providing bounds and exact values for specific cases.

## Contribution

It establishes bounds on the critical exponent ppa_k for zero-one laws and determines the exact value when k=4, advancing understanding of logical properties in random graphs.

## Key findings

- ppa_k = (k - 2 - t(k))^{-1} with t(k) = (k^{-2})
- Exact ppa_k value found for k=4
- Bounds improve understanding of logical thresholds in random graphs

## Abstract

For any fixed positive integer $k$, let $\alpha_{k}$ denote the smallest $\alpha \in (0,1)$ such that the random graph sequence $\left\{G\left(n, n^{-\alpha}\right)\right\}$ does not satisfy the zero-one law for the set $\mathcal{E}_{k}$ of all existential first order sentences that are of quantifier depth at most $k$. This paper finds upper and lower bounds on $\alpha_{k}$, showing that as $k \rightarrow \infty$, we have $\alpha_{k} = \left(k - 2 - t(k)\right)^{-1}$ for some function $t(k) = \Theta(k^{-2})$. We also establish the precise value of $\alpha_{k}$ when $k = 4$.