Approximate Zero-One Law

• Approximate Zero-One Law is a relaxation of the classical zero-one law that achieves near-deterministic outcomes through quantitative, finitary formulations.
• It encompasses diverse frameworks including continuous logic, Markov chains, and semiring semantics, each demonstrating asymptotic concentration of probabilities.
• The framework provides computable rates and metastable bounds, transforming qualitative infinite statements into precise, actionable asymptotic results.

An approximate zero-one law is a relaxation of a classical zero-one law in which asymptotic determinacy is preserved in a weaker form: probabilities become close to $0$ or $1$ up to arbitrary precision, sentence values concentrate near a fixed constant, or conditional probabilities of tail events become near $0$ or near $1$ on states carrying almost all mass. In the literature considered here, the term does not denote a single canonical theorem, but a family of technically distinct asymptotic principles arising in probability, logic, and model theory (Powell et al., 28 Aug 2025, Goldbring et al., 2019, Grabchak et al., 2020).

1. Finitary and metastable formulations

Powell and Wan formulate a syntactic zero-one law for a family $(B_{n,k})$ of events with $k \ge n$, subject to the closure condition

$$B_{n,m} \cup B_{l,k} \subseteq B_{n,k}, \qquad \text{for all } n \le m < l \le k,$$

and the abstract independence condition

$$P\left(\exists k \ge n\, B_{n,k}\right) < 1 \implies \sum_{i=0}^\infty P(B_{a_i,b_i}) < \infty$$

for all $n \in \mathbb{N}$ and all increasing sequences $n \le a_0 \le b_0 < a_1 \le b_1 < \cdots$. With

$1$0

the resulting theorem is

$1$1

The approximate zero-one law is obtained by finitising this statement via Gödel’s Dialectica interpretation. The metastable form is

$1$2

This replaces the infinitary event $1$3 by a quantitative finite-block dichotomy (Powell et al., 28 Aug 2025).

The significance of this reformulation is twofold. First, over classical logic, the approximate law is equivalent to the original zero-one law. Second, unlike the original statement, it is formulated entirely in terms of finite unions and intersections of events and admits a computational interpretation. The same framework is used for a quantitative version of the Erdős–Rényi theorem, for metastable almost sure convergence of series of independent random variables in the setting of Kolmogorov’s three-series theorem, and for a fully finitary, quantitative version of bond percolation (Powell et al., 28 Aug 2025).

2. Continuous logic and the almost sure theory of finite metric spaces

In continuous logic, sentences take values in $1$4, so the direct analogue of a classical zero-one law is a concentration theorem rather than a Boolean dichotomy. For finite metric spaces of diameter at most $1$5, Goldbring, Hart, and Kruckman prove that for every continuous logic sentence $1$6 in the language of pure metric spaces and every $1$7, there exists $1$8 such that

$1$9

Here $0$0 is the set of all valid metrics on $0$1, and $0$2 is the normalized Lebesgue measure on $0$3. The law is approximate because the value of $0$4 is determined only up to arbitrary precision, but it is still asymptotically rigid: each sentence has a unique almost sure value $0$5 (Goldbring et al., 2019).

The limiting theory is denoted $0$6. It is axiomatized by approximate extension axioms for the class $0$7 of finite metric spaces where all nonzero distances are at least $0$8, together with the sentence enforcing that all nonzero distances are at least $0$9. The approximate extension axioms are built from the configuration formula

$1$0

and the extension formula

$1$1

The theory $1$2 is complete, any two models of $1$3 are elementarily equivalent, and it captures the almost sure behavior of sentence values (Goldbring et al., 2019).

The model-theoretic profile of $1$4 is unusually strong. It eliminates quantifiers, is the model completion of the theory of finite metric spaces with all nonzero distances at least $1$5, has continuum many non-isomorphic separable models, and is supersimple of $1$6-rank $1$7, but not stable. A notable feature is that the Urysohn sphere does not have the same theory as $1$8; the almost sure theory is governed instead by the concentration of typical finite metrics near distances in $1$9 (Goldbring et al., 2019).

3. Approximate zero-one behavior for Markov chains

For a Markov chain $(B_{n,k})$0, the relevant object is the tail $(B_{n,k})$1-algebra

$(B_{n,k})$2

The approximate zero-one law for Markov chains does not assert that every tail event has probability $(B_{n,k})$3 or $(B_{n,k})$4. Instead, for any $(B_{n,k})$5, one studies the conditional probabilities $(B_{n,k})$6. With

$(B_{n,k})$7

the theorem is

$(B_{n,k})$8

$(B_{n,k})$9

$k \ge n$0

Thus, for large $k \ge n$1, with probability close to $k \ge n$2, the trajectory is in a state $k \ge n$3 where $k \ge n$4 is either close to $k \ge n$5 or close to $k \ge n$6 (Grabchak et al., 2020).

A stronger statement is also available: $k \ge n$7 where $k \ge n$8. There is an analogous result for the entrance $k \ge n$9-algebra when the chain is indexed by $$B_{n,m} \cup B_{l,k} \subseteq B_{n,k}, \qquad \text{for all } n \le m < l \le k,$$0, with $$B_{n,m} \cup B_{l,k} \subseteq B_{n,k}, \qquad \text{for all } n \le m < l \le k,$$1. The conceptual point is that the tail $$B_{n,m} \cup B_{l,k} \subseteq B_{n,k}, \qquad \text{for all } n \le m < l \le k,$$2-algebra of a general Markov chain need not be trivial, but the law of a tail event becomes asymptotically essentially discrete when conditioned on the present state. In the language of the source, the classical zero-one law’s sharp dichotomy becomes “almost all or almost none” in the Markov setting (Grabchak et al., 2020).

4. Multivalued almost-sure laws in semiring semantics

Semiring semantics evaluates first-order statements by values in a commutative semiring $$B_{n,m} \cup B_{l,k} \subseteq B_{n,k}, \qquad \text{for all } n \le m < l \le k,$$3, and random semiring interpretations generalise random structures. In this setting, the classical Boolean dichotomy is replaced by almost sure valuation. For a sentence $$B_{n,m} \cup B_{l,k} \subseteq B_{n,k}, \qquad \text{for all } n \le m < l \le k,$$4 and $$B_{n,m} \cup B_{l,k} \subseteq B_{n,k}, \qquad \text{for all } n \le m < l \le k,$$5, one considers

$$B_{n,m} \cup B_{l,k} \subseteq B_{n,k}, \qquad \text{for all } n \le m < l \le k,$$6

For positive semirings, the classical $$B_{n,m} \cup B_{l,k} \subseteq B_{n,k}, \qquad \text{for all } n \le m < l \le k,$$7-$$B_{n,m} \cup B_{l,k} \subseteq B_{n,k}, \qquad \text{for all } n \le m < l \le k,$$8 law implies that every first-order sentence is, asymptotically, either almost surely evaluated to $$B_{n,m} \cup B_{l,k} \subseteq B_{n,k}, \qquad \text{for all } n \le m < l \le k,$$9 by random semiring interpretations, or almost surely takes only values different from $$P\left(\exists k \ge n\, B_{n,k}\right) < 1 \implies \sum_{i=0}^\infty P(B_{a_i,b_i}) < \infty$$0. The stronger result is a partition of first-order sentences into classes $$P\left(\exists k \ge n\, B_{n,k}\right) < 1 \implies \sum_{i=0}^\infty P(B_{a_i,b_i}) < \infty$$1 such that every sentence in $$P\left(\exists k \ge n\, B_{n,k}\right) < 1 \implies \sum_{i=0}^\infty P(B_{a_i,b_i}) < \infty$$2 evaluates almost surely to $$P\left(\exists k \ge n\, B_{n,k}\right) < 1 \implies \sum_{i=0}^\infty P(B_{a_i,b_i}) < \infty$$3 under random semiring interpretations (Grädel et al., 2022).

For finite or infinite lattice semirings, this partition collapses to three classes $$P\left(\exists k \ge n\, B_{n,k}\right) < 1 \implies \sum_{i=0}^\infty P(B_{a_i,b_i}) < \infty$$4, $$P\left(\exists k \ge n\, B_{n,k}\right) < 1 \implies \sum_{i=0}^\infty P(B_{a_i,b_i}) < \infty$$5, and $$P\left(\exists k \ge n\, B_{n,k}\right) < 1 \implies \sum_{i=0}^\infty P(B_{a_i,b_i}) < \infty$$6, where $$P\left(\exists k \ge n\, B_{n,k}\right) < 1 \implies \sum_{i=0}^\infty P(B_{a_i,b_i}) < \infty$$7 is the smallest non-zero value. For the semiring of natural numbers, the classes $$P\left(\exists k \ge n\, B_{n,k}\right) < 1 \implies \sum_{i=0}^\infty P(B_{a_i,b_i}) < \infty$$8 no longer cover all first-order sentences and must be extended by the class of sentences that almost surely evaluate to unboundedly large values. This is not a zero-one law in the strict Boolean sense, but it is an asymptotic law of the same type: formulas admit sharply delimited almost sure valuations. The problem of computing the almost sure valuation of a first-order sentence on finite lattice semirings is PSPACE-complete (Grädel et al., 2022).

5. Exactness, boundaries, and non-equivalent meanings of approximation

Approximation is not universal across zero-one phenomena. In automata theory, the regular case is explicitly non-approximate: for regular languages, the law is exact. A regular language has the zero-one law if and only if its syntactic monoid has a zero element, the class of zero-one languages is closed under Boolean operations and quotients, and there is an $$P\left(\exists k \ge n\, B_{n,k}\right) < 1 \implies \sum_{i=0}^\infty P(B_{a_i,b_i}) < \infty$$9 algorithm for testing the property from a DFA with $n \in \mathbb{N}$0 states. The same source notes that some non-regular languages can have approximate zero-one laws, but for regular languages, the law is exact (Sin'ya, 2015).

A different boundary appears in the study of positional symmetries. For a countable family of i.i.d. random variables, sufficiently symmetric events are deterministic, and the framework extends beyond the i.i.d. setting to independent but not identically distributed variables and to Kolmogorov mixing processes. That theory encompasses the Hewitt–Savage zero-one law and the ergodicity of the Bernoulli process, but it remains an exact law. The same work observes that approximate zero-one laws, like Russo’s or the FKG sharp threshold theorem for monotone Boolean functions with high symmetry, say that probabilities of certain events are close to $n \in \mathbb{N}$1 or $n \in \mathbb{N}$2 in large or symmetric systems, and it explicitly leaves open whether the information-theoretic approach can yield new results on approximate/a.s. zero-one phenomena (Ayach et al., 2024).

The surveyed results therefore distinguish several technical meanings of approximation. In one meaning, approximation is a finitary or metastable replacement for an infinitary dichotomy. In another, it is concentration of continuous-logic truth values near a constant $n \in \mathbb{N}$3. In a third, it is the asymptotic collapse of state-conditional probabilities to neighborhoods of $n \in \mathbb{N}$4 and $n \in \mathbb{N}$5, even when the underlying tail $n \in \mathbb{N}$6-algebra is not trivial.

6. Applications and significance

The modern significance of approximate zero-one laws is largely quantitative. In the Dialectica-based framework, the finitary law yields explicit computable rates and metastable bounds: for any given $n \in \mathbb{N}$7, $n \in \mathbb{N}$8, and any choice of $n \in \mathbb{N}$9, one can compute how far one needs to look to guarantee one of the finite alternatives in the dichotomy. This is precisely what allows the law to function as a modular replacement for classical zero-one laws inside proofs of the Erdős–Rényi theorem, metastable almost sure convergence, and percolation statements (Powell et al., 28 Aug 2025).

In model theory, the significance is structural rather than algorithmic. For finite metric spaces, every continuous logic sentence has an almost sure value determined by any model of $n \le a_0 \le b_0 < a_1 \le b_1 < \cdots$0, and the limiting theory is complete, quantifier-eliminating, and model-complete (Goldbring et al., 2019). In semiring semantics, the asymptotic classification of sentences by almost sure valuation is fine-grained enough that the associated decision problem becomes PSPACE-complete on finite lattice semirings (Grädel et al., 2022). In stochastic-process language, the Markov-chain law identifies a robust asymptotic mechanism by which tail uncertainty is driven into near-$n \le a_0 \le b_0 < a_1 \le b_1 < \cdots$1/near-$n \le a_0 \le b_0 < a_1 \le b_1 < \cdots$2 conditional regimes without any global tail triviality assumption (Grabchak et al., 2020).

Approximate zero-one law thus names a family of asymptotic rigidity phenomena rather than a single theorem. What unifies these phenomena is not the precise form of the limit statement, but the replacement of qualitative infinitary certainty by a quantitative, computable, or multivalued surrogate that still forces large-scale asymptotic determinacy.