Search arXivSearch

arXiv · 2512.21278

Taking model-complete cores

Abstract

A first-order theory $T$ is a model-complete core theory if every first-order formula is equivalent modulo $T$ to an existential positive formula; a core companion of a theory $T$ is a model-complete core theory $S$ such that every model of $T$ maps homomorphically to a model of $S$ and vice-versa. Whilst core companions may not exist in general, if they exist, they are unique. Moreover, $ω$-categorical theories always have a core companion, which is also $ω$-categorical. We show that many model-theoretic properties, such as stability, $\mathrm{NIP}$, simplicity, and $\mathrm{NSOP}_k$ for ${k\in\mathbb{N}_{>0}}$, are preserved by moving to the core companion of a complete theory. On the other hand, we show that the classes of theories of structures interpretable over $({\mathbb N};=)$ and over $({\mathbb Q};<)$ are both not closed under taking core companions. The first class is contained in the class of theories of $ω$-stable first-order reducts of finitely homogeneous relational structures, which was studied by Lachlan in the 80's. We conjecture the two classes to be equal. To support our conjecture we prove that all structures in Lachlan's class are trace definable in $(\mathbb{N}; =)$, confirming a conjecture of Walsberg.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Manuel Bodirsky, Bertalan Bodor, Paolo Marimon. 2026-07-28. Taking model-complete cores. https://arxiv.org/abs/2512.21278

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

KEEP EXPLORING

Related papers

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

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

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