Related papers: Computable valued fields

It will be shown that the polynomial time computable numbers form a field, and especially an algebraically closed field.

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…

We develop a notion of a `canonical $\mathcal{C}$-henselian valuation' for a class $\mathcal{C}$ of field extensions, generalizing the construction of the canonical henselian valuation of a field. We use this to show that the $p$-adic…

We prove that NIP valued fields of positive characteristic are henselian. Furthermore, we partially generalize the known results on dp-minimal fields to dp-finite fields. We prove a dichotomy: if K is a sufficiently saturated dp-finite…

A henselian valued field $K$ is called a tame field if its algebraic closure $\tilde{K}$ is a tame extension, that is, the ramification field of the normal extension $\tilde{K}|K$ is algebraically closed. Every algebraically maximal…

We investigate $IPA$ - real closed fields, that is, real closed fields which admit an integer part whose non-negative cone is a model of Peano Arithmetic. We show that the value group of an $IPA$ - real closed field is an exponential group…

Let $K$ be a complete discrete valued field of characteristic $p$ with residue $k$ which is not necessarily perfect. We prove the Conjecture in \cite{cs} that a $p$-algebra over $K$ contains a totally ramified cyclic maximal subfield if it…

The empty set of course contains no computable point. On the other hand, surprising results due to Zaslavskii, Tseitin, Kreisel, and Lacombe assert the existence of NON-empty co-r.e. closed sets devoid of computable points: sets which are…

A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…

We show a transfer principle for the property that all types realised in a given elementary extension are definable. It can be written as follows: a Henselian valued fields is stably embedded in an elementary extension if and only if its…

We show that for both the unary relation of transcendence and the finitary relation of algebraic independence on a field, the degree spectra of these relations may consist of any single computably enumerable Turing degree, or of those c.e.…

We show that separably closed valued fields of finite imperfection degree (either with lambda-functions or commuting Hasse derivations) eliminate imaginaries in the geometric language. We then use this classification of interpretable sets…

Let K be a valued field of characteristic p>0 with non-p-divisible value group. We show that every finite embedding problem for K whose kernel is a p-group is properly solvable.

We introduce a notion of algorithmic randomness for algebraic fields. We prove the existence of a continuum of algebraic extensions of $\mathbb{Q}$ that are random according to our definition. We show that there are noncomputable algebraic…

We prove that an infinite field interpretable in a $p$-adically closed field $K$ is definably isomorphic to a finite extension of $K$. The result remains true in any $P$-minimal field where definable functions are generically…

A field $k$ is called geometrically $C_1$ if every smooth projective separably rationally connected $k$-variety has a $k$-rational point. Given a henselian valued field of equal characteristic $0$ with divisible value group, we show that…

Polynomial completeness results aim at characterizing those functions that are induced by polynomials. Each polynomial function is congruence preserving, but the opposite need not be true. A finite algebraic structure $\mathbf{A}$ is called…

In recent decades, the defect of finite extensions of valued fields has emerged as the main obstacle in several fundamental problems in algebraic geometry such as the local uniformization problem. Hence, it is important to identify…

In this paper, we study multizeta values over function fields in characteristic $p$. For each $d \geq 2$, we show that when the constant field has cardinality $> 2$, the field generated by all multizeta values of depth $d$ is of infinite…

We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…