Related papers: Computable valued fields
We prove the dp-finite case of the Shelah conjecture on NIP fields. If K is a dp-finite field, then K admits a non-trivial definable henselian valuation ring, unless K is finite, real closed, or algebraically closed. As a consequence, the…
We study the behaviour of forking in valued fields, and we give several sufficient conditions for parameter sets in a Henselian valued field of residue characteristic zero to be an extension base. Notably, we consider arbitrary (potentially…
We give a sufficient condition for an algebraic structure to have a computable presentation with a computable basis and a computable presentation with no computable basis. We apply the condition to differentially closed, real closed, and…
We prove that for p-optimal fields (a very large subclass of p-minimal fields containing all the known examples) a cell decomposition theorem follows from methods going back to Denef's paper [Invent. Math, 77 (1984)]. We derive from it the…
The main purpose of the paper is to establish a closedness theorem over Henselian valued fields $K$ of equicharacteristic zero (not necessarily algebraically closed) with separated analytic structure. It says that every projection with a…
Local fields, and fields complete with respect to a discrete valuation, are essential objects in commutative algebra, with applications to number theory and algebraic geometry. We formalize in Lean the basic theory of discretely valued…
In this paper we develop general techniques for classes of computable real numbers generated by subsets of total computable (recursive functions) with special restrictions on basic operations in order to investigate the following problems:…
In this note we study sets of NIP formulas in some theories of fields and valued fields, with a special focus on the sets of quantifier-free and existential formulas. First, we give a new proof of the fact that Separably Closed Valued…
We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…
We study the definability of convex valuations on ordered fields, with a particular focus on the distinguished subclass of henselian valuations. In the setting of ordered fields, one can consider definability both in the language of rings…
We continue the work of Kaplansky on immediate valued field extensions and determine special properties of elements in such extensions. In particular, we are interested in the question when an immediate valued function field of…
We consider the model theoretic notion of convex orderability, which fits strictly between the notions of VC-minimality and dp-minimality. In some classes of algebraic theories, however, we show that convex orderability and VC-minimality…
We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…
Several researchers have recently established that for every Turing degree $\boldsymbol{c}$, the real closed field of all $\boldsymbol{c}$-computable real numbers has spectrum $\{\boldsymbol{d}~:~\boldsymbol{d}'\geq\boldsymbol{c}"\}$. We…
A field with an absolute value function is a basic type of metric space, which includes the real and complex numbers with their standard metrics, and ultrametrics on fields like the p-adic numbers. Here we try to give some perspectives of…
We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…
We prove that the theory of a Henselian valued field of characteristic zero, with finite ramification, and whose value group is a $Z$-group, is model-complete in the language of rings if the theory of its residue field is model-complete in…
This thesis is a contribution to the model theory of valued fields. We study forking in valued fields and some of their reducts. We focus particularly on pseudo-local fields, the ultraproducts of residue characteristic zero of the p-adic…
A computably presented algebraic field $F$ has a \emph{splitting algorithm} if it is decidable which polynomials in $F[X]$ are irreducible there. We prove that such a field is computably categorical iff it is decidable which pairs of…
We study infinite groups interpretable in three families of valued fields: $V$-minimal, power bounded $T$-convex, and $p$-adically closed fields. We show that every such group $G$ has unbounded exponent and that if $G$ is dp-minimal then it…