Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2408.07033

Tame pairs of transseries fields

Nigel Pynn-Coates
View original source ↗Read source document ↗Export metadata ↓

Abstract

This paper concerns pairs of models of the theory of the differential field of logarithmic-exponential transseries that are tame as a pair of real closed fields. That is, the smaller model is bounded inside the larger model and there exists a standard part map. This covers for instance the differential fields of hyperseries or surreal numbers or maximal Hardy fields equipped with suitable enlargements of the differential field of transseries. The theory of such pairs is complete and model complete in a natural language and it has quantifier elimination in the same language expanded by two predicates and a standard part map. Additionally, the smaller model is purely stably embedded in the pair, and hence so is the constant field. More generally, we study differential-Hensel-Liouville closed pre-$H$-fields, i.e., pre-$H$-fields that are differential-henselian, real closed, and closed under exponential integration, equipped with lifts of their differential residue fields, and establish similar results in that setting relative to the differential residue field.

Explore related subjects

math.LOmath.AC

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Nigel Pynn-Coates. 2026-07-20. Tame pairs of transseries fields. https://arxiv.org/abs/2408.07033

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↗