SearcharxivSearch

arXiv · 1409.3141

The model theory of separably tame valued fields

Abstract

A henselian valued field $K$ is called separably tame if its separable-algebraic closure $K^{\operatorname{sep}}$ is a tame extension, that is, the ramification field of the normal extension $K^{\operatorname{sep}}|K$ is separable-algebraically closed. Every separable-algebraically maximal Kaplansky field is a separably tame field, but not conversely. In this paper, we prove Ax-Kochen-Ershov Principles for separably tame fields. This leads to model completeness and completeness results relative to the value group and residue field. As the maximal immediate extensions of separably tame fields are in general not unique, the proofs have to use much deeper valuation theoretical results than those for other classes of valued fields which have already been shown to satisfy Ax-Kochen-Ershov Principles. Our approach also yields alternate proofs of known results for separably closed valued fields.

Explore related subjects

Keep this discovery

BibTeXRIS

Franz-Viktor Kuhlmann, Koushik Pal. 2014-09-10. The model theory of separably tame valued fields. https://arxiv.org/abs/1409.3141

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

KEEP EXPLORING

Related papers

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

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

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