Related papers: Computable valued fields

Given a henselian valuation, we study its definability (with and without parameters) by examining conditions on the value group. We show that any henselian valuation whose value group is not closed in its divisible hull is definable in the…

One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…

Admitting a non-trivial $p$-henselian valuation is a weaker assumption on a field than admitting a non-trivial henselian valuation. Unlike henselianity, $p$-henselianity is an elementary property in the language of rings. We are interested…

We are studying the degrees in which a computable structure is relatively computably categoricity, i.e., computably categorcial among all non-computable copies of the structure. Unlike the degrees of computable categoricity we can bound the…

We show that every henselian valued field $L$ of residue characteristic 0 admits a proper subfield $K$ which is dense in $L$. We present conditions under which this can be taken such that $L|K$ is transcendental and $K$ is henselian. These…

This work presents author's explicit methods of constructing abelian extensions of complete discrete valuation fields. His approach to explicit equations of a cyclic extension of degree p^n which contains a given cyclic extension of degree…

We prove a number of elementary facts about computability in partial combinatory algebras (pca's). We disprove a suggestion made by Kreisel about using Friedberg numberings to construct extensional pca's. We then discuss separability and…

We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…

We are concerned with topology of Hensel minimal structures on non-trivially valued fields $K$, whose axiomatic theory was introduced in a recent paper by Cluckers-Halupczok-Rideau. We additionally require that every definable subset in the…

We show that every definable nested family of closed and bounded subsets of a $P$-minimal field $K$ has non-empty intersection. As an application we answer a question of Darni\`ere and Halupczok showing that $P$-minimal fields satisfy the…

In this paper we extend the approach of M. Cavaleri to effective amenability to the class of computably enumerable groups, i.e. in particular we do not assume that groups are finitely generated. In the case of computable groups we also…

Suppose that $k$ is an arbitrary field. Consider the field $k((x_1,...,x_n))$, which is the quotient field of the ring $k[[x_1,...,x_n]]$ of formal power series in the variables $x_1,...,x_n$, with coefficients in $k$. Suppose that $\sigma$…

A linear code is said to be $\Delta$-divisible if the Hamming weights of all its codewords are divisible by $\Delta$. The $p$-adic valuation of a code is defined as the greatest integer $t$ such that the code is $p^t$-divisible. In this…

We introduce a notion of valued module which is suitable to study valued fields of positive characteristic. Then we built-up a robust theory of henselianity in the language of valued modules and prove Ax-Kochen Ershov type results.

We study the degrees of selector functions related to the degrees in which a rigid computable structure is relatively computably categorical. It is proved that for some structures such degrees can be represented as the unions of upper cones…

We give a complete list of the one-dimensional groups definable in algebraically closed valued fields and i the pseudo-local fields, up to a finite index subgroup and a quotient by a finite subgroup.

We prove the closedness theorem over Henselian valued fields, which was established over rank one valued fields in one of our recent papers. In the proof, as before, we use the local behaviour of definable functions of one variable and the…

We continue the investigation of analytic spaces from the perspective of computable structure theory. We show that if $p \geq 1$ is a computable real, and if $\Omega$ is a nonzero, non-atomic, and separable measure space, then every…

A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact…

In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…