Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2310.06787

Generically Stable Measures and Distal Regularity in Continuous Logic

Aaron Anderson
View original source ↗Read source document ↗Export metadata ↓

Abstract

We develop a theory of generically stable and smooth Keisler measures in NIP metric theories, generalizing the case of classical logic. Using smooth extensions, we verify that fundamental properties of (Borel)-definable measures and the Morley product hold in the NIP metric setting. With these results, we prove that as in discrete logic, generic stability can be defined equivalently through definability properties, statistical properties, or behavior under the Morley product. We also examine weakly orthogonal Keisler measures, characterizing weak orthogonality in terms of various analytic regularity properties. We then examine Keisler measures in distal metric theories, proving that as in discrete logic, distality is characterized by all generically stable measures being smooth, or by all pairs of generically stable measures being weakly orthogonal. We then use this, together with our results on weak orthogonality and a cutting lemma, to find analytic versions of distal regularity and the strong Erdős-Hajnal property.

Explore related subjects

math.LOmath.CO

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Aaron Anderson. 2023-10-10. Generically Stable Measures and Distal Regularity in Continuous Logic. https://arxiv.org/abs/2310.06787

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Bluebirds and mockingbirds cannot produce a fixed-point combinator

Let $B$ be the bluebird combinator with reduction rule $Bxyz \to_{w} x\left(yz\right)$, let $M$ be the mockingbird combinator with reduction rule $Mx \to_{w} xx$, and let $I$ be the identity bird combinator with reduction rule $Ix \to_{w} x$. A fixed-point combinator, called a sage bird by Smullyan, is a closed term $Y$ such that, for a fresh variable $x$, $Yx$ is equivalent to $x\left(Yx\right)$ under these reduction rules. For a fixed variable $x$, we construct an invariant $\mathrm{Tr}_{x}\left(u\right)$ of a $BMI$-term $u$ with respect to $\to_{w}$. This invariant traces the occurrences of $x$ in the leftmost-innermost reduction sequence of $u$. We then prove that $\mathrm{Tr}_{x}\left(Yx\right) \neq \mathrm{Tr}_{x}\left(x^{r}\left( Yx \right)\right)$ for every $x$-free $BMI$-term $Y$ and every $r\geq 1$. Consequently, there exists no fixed-point combinator in $BMI$-combinatory logic. This provides a negative answer to the problem posed by Smullyan in 1985.

math.LO↗
arXiv2026

Pointwise provable equality and the failure of composition

Montagna (1989) and Di Paola--Montagna (1991) claim that the algebraic systems $S'$ and $S'_T$, respectively, are categories. We show that the proposed composition is not independent of the choice of representatives. For every consistent recursively enumerable extension $T$ of Peano arithmetic ($\mathrm{PA}$), we exhibit two program indices that are pointwise provably equal in $T$ but yield inequivalent composites when each is run after the same program. Montagna's $S'$ is the case $T=\mathrm{PA}$. The failure already occurs for partial maps from $ω$ to itself. Weak totality and the proposed range assignment also depend on the choice of representatives. More generally, for consistent $T\supseteq\mathrm{PA}$, pointwise provable equality is a composition congruence exactly when $T$ proves every true $Π^0_1$ sentence, in which case it is extensional equality. This completeness condition fails for every consistent recursively enumerable $T\supseteq\mathrm{PA}$ by Gödel's second incompleteness theorem. For every extension $T\supseteq\mathrm{PA}$, the least composition congruence containing pointwise provable equality is extensional equality if $T$ is $Σ^0_1$-sound and the universal relation otherwise.

math.LO↗
arXiv2026

Compactness via Consistency Properties

We will use consistency properties to characterize strongly compact cardinals, first showing an adequate Model Existence Theorem for larger fragments.

math.LO↗