Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 1910.12171

Model theory of differential-henselian pre-$H$-fields

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

Abstract

Pre-$H$-fields are ordered valued differential fields satisfying some basic axioms coming from transseries and Hardy fields. We study pre-$H$-fields that are differential-Hensel-Liouville closed, that is, differential-henselian, real closed, and closed under exponential integration, establishing an Ax--Kochen/Ershov theorem for such structures: the theory of a differential-Hensel-Liouville closed pre-$H$-field is determined by the theory of its ordered differential residue field; this result fails if the assumption of closure under exponential integration is dropped. In a two-sorted setting with one sort for a differential-Hensel-Liouville closed pre-$H$-field and one sort for its ordered differential residue field, we eliminate quantifiers from the pre-$H$-field sort, from which we deduce that the ordered differential residue field is stably embedded and if it has NIP, then so does the two-sorted structure. Similarly, the one-sorted theory of differential-Hensel-Liouville closed pre-$H$-fields with closed ordered differential residue field has quantifier elimination, is the model completion of the theory of pre-$H$-fields with gap~$0$, and is complete, distal, and locally o-minimal.

Explore related subjects

math.LOmath.AC

Keep this discovery

BibTeXRIS

Nigel Pynn-Coates. 2019-10-27. Model theory of differential-henselian pre-$H$-fields. https://doi.org/10.1017/jsl.2025.28

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↗