Related papers: Definability and Decidability in Infinite Algebrai…

We prove the following theorems: Theorem 1: For any E-field with cyclic kernel, in particular $\mathbb C$ or the Zilber fields, all real abelian algebraic numbers are pointwise definable. Theorem 2: For the Zilber fields, the only pointwise…

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 prove that the first-order theory of any function field K of characteristic p>2 is undecidable in the language of rings without parameters. When K is a function field in one variable whose constant field is algebraic over a finite field,…

The genus gen(D) of a finite-dimensional central division algebra D over a field F is defined as the collection of classes [D'] in the Brauer group Br(F), where D' is a central division F-algebra having the same maximal subfields as D. For…

In the setting of constructive mathematics, we suggest and study a framework for decidability of properties, which allows for finer distinctions than just "decidable, semidecidable, or undecidable". We work in homotopy type theory and use…

It is shown that over an arbitrary countable field, there exists a finitely generated algebra that is nil, infinite dimensional, and has Gelfand-Kirillov dimension at most three.

Let $\mathcal{K}=(K,v,\ldots)$ be a dp-minimal expansion of a non-trivially valued field of characteristic $0$ and $\mathcal{F}$ an infinite field interpretable in $\mathcal{K}$. Assume that $\mathcal{K}$ is one of the following: (i)…

We construct and study fields F with the property that F has infinitely many extensions of some fixed degree, but E*/(E*)^n is finite for every finite extension E of F and every n>0.

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.…

It is shown that the universal theory of the free pseudocomplemented distributive lattice is decidable and a recursive axiomatization is presented. This contrasts with the case of the full elementary theory of the finitely generated free…

Let K be a field not of characteristic 2 such that every finite separable extension of K is cyclic. Let A be an abelian variety over K. If K is infinite, then A(K) is Zariski-dense in A. If K is not locally finite, the rank of A over K is…

The aim of this paper is to extend the structure theory for infinitely generated modules over tame hereditary algebras to the more general case of modules over concealed canonical algebras. Using tilting, we may assume that we deal with…

Let $k$ be a field containing an algebraically closed field of characteristic zero. If $G$ is a finite group and $D$ is a division algebra over $k$, finite dimensional over its center, we can associate to a faithful $G$-grading on $D$ a…

This paper is the second in a series of three, the aim of which is to construct algebraic geometry over a free metabelian Lie algebra $F$. For the universal closure of free metabelian Lie algebra of finite rank $r \ge 2$ over a finite field…

We construct a topology on a given algebraically closed field with a distinguished subfield which is also algebraically closed. This topology is finer than Zariski topology and it captures the sets definable in the pair of algebraically…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Let K be a number field. A finite group G is called K-admissible if there exists a G-crossed product K-division algebra. K-admissibility has a necessary condition called K-preadmissibility that is known to be sufficient in many cases. It is…

We prove that if $\mathbb{F}$ is an algebraically closed field of zero characteristic which has infinite transcendence degree over $\mathbb{Q}$, then there exists a field automorphism $\varphi$ of ${\rm SL}_n(\mathbb{F})$ and ${\rm…

We define a certain finite set in set theory $\{x\mid\varphi(x)\}$ and prove that it exhibits a universal extension property: it can be any desired particular finite set in the right set-theoretic universe and it can become successively any…

We study first-order logic (FO) over the structure consisting of finite words over some alphabet $A$, together with the (non-contiguous) subword ordering. In terms of decidability of quantifier alternation fragments, this logic is…