English

Modeling FO-limits for monadically stable sequences

Logic 2025-08-13 v1 Combinatorics

Abstract

We show that given a monadically stable theory TT, a sufficiently saturated MT\mathbf M \models T, and a coherent system of probability measures on the σ\sigma-algebras generated by parameter-definable sets of M\mathbf M in each dimension, we may produce a totally Borel BM\mathbf B \prec \mathbf M realizing these measures. Our main application is to prove that every FO-convergent sequence of structures (with countable signature) from a monadically stable class admits a modeling limit. As another consequence, we prove a Borel removal lemma for monadically stable Lebesgue relational structures.

Keywords

Cite

@article{arxiv.2508.08960,
  title  = {Modeling FO-limits for monadically stable sequences},
  author = {S. Braunfeld and J. Nešetřil and P. Ossona de Mendez},
  journal= {arXiv preprint arXiv:2508.08960},
  year   = {2025}
}
R2 v1 2026-07-01T04:46:08.486Z