Modeling FO-limits for monadically stable sequences
Logic
2025-08-13 v1 Combinatorics
Abstract
We show that given a monadically stable theory , a sufficiently saturated , and a coherent system of probability measures on the -algebras generated by parameter-definable sets of in each dimension, we may produce a totally Borel 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.
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}
}