# A convergence law for continuous logic and continuous structures with finite domains

arXiv: https://arxiv.org/abs/2504.08923 · HTML: https://mlsanity.com/paper/2504.08923/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- Builds on 7 of its 43 references that are in the map.
- First posted on arXiv 11 Apr 2025.

## Builds on (most cited first, 7 of 7)

- [An asymptotic analysis of probabilistic logic programming, with implications for expressing projective families of distributions](https://mlsanity.com/paper/2102.08777/) (2021)
- [Zero-One Laws of Graph Neural Networks](https://mlsanity.com/paper/2301.13060/) (2023)
- [Almost Surely Asymptotically Constant Graph Neural Networks](https://mlsanity.com/paper/2403.03880/) (2024)
- [Asymptotic elimination of partially continuous aggregation functions in directed graphical models](https://mlsanity.com/paper/2106.10122/) (2021)
- [On the relative asymptotic expressivity of inference frameworks](https://mlsanity.com/paper/2204.09457/) (2022)
- [Random expansions of trees with bounded height](https://mlsanity.com/paper/2410.11775/) (2024)
- [Zero-One Laws and Almost Sure Valuations of First-Order Logic in Semiring Semantics](https://mlsanity.com/paper/2203.03425/) (2022)

## Built on by (most cited first, 1 of 1)

- [A concentration result for multilayer feedforward neural networks](https://mlsanity.com/paper/2608.15335/) (2026)

## Abstract (arXiv)

We consider continuous relational structures with finite domain [n] := 1, ldots, n and a many valued logic, CLA, with values in the unit interval and which uses continuous connectives and continuous aggregation functions. CLA subsumes first-order logic on ``conventional'' finite structures. To each relation symbol R and identity constraint ic on a tuple the length of which matches the arity of R we associate a continuous probability density function μRic : [0, 1] → [0, ∞). We also consider a probability distribution on the set Wn of continuous structures with domain [n] which is such that for every relation symbol R, identity constraint ic, and tuple bara satisfying ic, the distribution of the value of R(bara) is given by μRic, independently of the values for other relation symbols or other tuples. In this setting we prove that every formula in CLA is asymptotically equivalent to a formula without any aggregation function. This is used to prove a convergence law for CLA which reads as follows for formulas without free variables: If varphi ∈ CLA has no free variable and I subseteq [0, 1] is an interval, then there is α ∈ [0, 1] such that, as n tends to infinity, the probability that the value of varphi is in I tends to α.