MODELING FO-LIMITS FOR MONADICALLY STABLE SEQUENCES

We show that given a monadically stable theory $T$, a sufficiently saturated $\mathbf M \models T$, and a coherent system of probability measures on the $σ$-algebras generated by parameter-definable sets of $\mathbf M$ in each dimension, we may produce a totally Borel $\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.

Authors

Publication Details

Journal
Journal of Symbolic Logic
Published
2026-11-06
DOI
https://doi.org/10.1017/jsl.2026.10273
Citations
1
Primary Topic
Advanced Topology and Set Theory
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
article

MODELING FO-LIMITS FOR MONADICALLY STABLE SEQUENCES

Patrice Ossona de Mendez, Jaroslav Nešetřil, Samuel Braunfeld
1 citations
Journal of Symbolic Logic
Advanced Topology and Set Theory
article

MODELING FO-LIMITS FOR MONADICALLY STABLE SEQUENCES

Patrice Ossona de Mendez, Jaroslav Nešetřil, Samuel Braunfeld
article en
1 citations

Abstract

We show that given a monadically stable theory $T$, a sufficiently saturated $\mathbf M \models T$, and a coherent system of probability measures on the $σ$-algebras generated by parameter-definable sets of $\mathbf M$ in each dimension, we may produce a totally Borel $\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.

Journal of Symbolic Logic
European Commission, Grantová Agentura České Republiky
Openalex Percentile: Top 93%
Advanced Topology and Set Theory
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon