Search arXiv⌕ Search
Home/Archive/arXiv

arXiv · 2305.12145

Ax-Kochen-Ershov principles for finitely ramified henselian fields

Sylvy Anscombe·Philip Dittmann·Franziska Jahnke
View original source ↗Read source document ↗Export metadata ↓

Abstract

We study the model theory of finitely ramified henselian valued fields of fixed initial ramification, obtaining versions of the Ax-Kochen-Ershov principle as follows. We identify the induced structure on the residue field and show that once the residue field is endowed with this structure, the theory of the valued field is determined by the theories of the enriched residue field and the value group. Similarly, we show that the existential theory of the valued field is determined by the positive existential theory of the enriched residue field. We also prove that an embedding of finitely ramified henselian valued fields is existentially closed as soon as the induced embeddings of value group and residue field are existentially closed. This last result requires no enrichment of the residue field, in analogy to the corresponding result for model completeness, which holds by results of Ershov and Ziegler.

Explore related subjects

math.LO

Keep this discovery

BibTeXRIS

Sylvy Anscombe, Philip Dittmann, Franziska Jahnke. 2023-05-20. Ax-Kochen-Ershov principles for finitely ramified henselian fields. https://doi.org/10.1090/tran%2F9271

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↗