Searcharxiv⌕ 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. 2024-08-13. 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

There is no maximal $K$-degree

The Kolmogorov complexity of a string characterize how complex it is to describe the string. If every prefix of a real $x$ is more complex to describe than every prefix (of the same length) of real $y$, then it is seen as $x$ is more complex to describe than $y$. It is wondered if there is a real $x$ so that no other reals are strictly more complex (to describe) than $x$. The behavior of Kolmogorov complexity functions generated by reals (namely $n\mapsto$ the minimal description length of the real) is quite chaos. Therefore, it is widely believed that there are many reals that are maximally complex to describe. For instance, it is conjectured that all random enough reals have maximal $K$-degree. In this paper, it is shown that there is no real with maximal $K$-degree. Actually, for almost all real $x$, we can uniformly computably find another real whose $K$-degree is strictly above $x$.

math.LO↗
arXiv2026

Quadruples and cubes

We prove, in $\mathsf{ZFC}$, that the $\lambda$-terraced cube relation fails whenever $\lambda$ is an uncountable cardinal. The corresponding terraced relation for quadruples fails for every $\lambda$. If $\lambda$ is $\aleph_0$ then the pretinent terraced relation has consistency strength of at least one Woodin cardinal. We prove positive polarized relations at a successor and a double successor from wondrous ideals. We show, however, that there are no such ideals over two consecutive cardinals simultaneously.

math.LO↗
arXiv2026

Possibilistic Logic over a Logic of Formal Inconsistency

In this article, we have introduced a new possibilistic logic on a logic of formal inconsistency with the aim of developing a possibility theoretic framework to deal with uncertainty and inconsistency meaningfully without leading to a system collapse. We have discussed the syntax and semantics for this logic and have proved the soundness and completeness theorems. A set of new measures of consistency, contradictoriness, and triviality of a set of formulas have been defined. These have then been put to use in an example to show that this framework can provide better means of machine reasoning.

math.LO↗