Related papers: Finite Undecidability in Fields II: PAC, PRC and P…

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…

A commutative ring R is said to be coverable if it is the union of its proper subrings and said to be finitely coverable if it is the union of a finite number of them. In the latter case, we denote by {\sigma}(R) the minimal number of…

We prove that every non-trivial valuation on an infinite superrosy field of positive characteristic has divisible value group and algebraically closed residue field. In fact, we prove the following more general result. Let $K$ be a field…

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…

Motivated by the quest for a logic for PTIME and recent insights that the descriptive complexity of problems from linear algebra is a crucial aspect of this problem, we study the solvability of linear equation systems over finite groups and…

This PhD deals with the notion of pseudo algebraically closed (PAC) extensions of fields. It develops a group-theoretic machinery, based on a generalization of embedding problems, to study these extensions. Perhaps the main result is that…

We classify fields having finitely many finite non-commutative (not necessarily central) division algebras over them. In the process, we introduce the notion of anti-closure of a field and also make comments on fields having a linear…

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…

The notion of symmetry in polynomial rings with several indeterminates is generalized to polynomial rings over finite fields. Families of extensions of the projective line over a finite field of constants possessing this property are…

We prove the undecidability of determining whether a Turing machine yields an eventually periodic trajectory. From this, we deduce the undecidability of orbit finiteness in the polynomial dynamical system on infinite tuples of integers.

Let $k$ be a perfect field of characteristic $p \geq 3$, and let $K$ be a finite totally ramified extension of $K_0 = W(k)[p^{-1}]$. Let $L_0$ be a complete discrete valuation field over $K_0$ whose residue field has a finite $p$-basis, and…

Using a novel rewriting problem, we show that several natural decision problems about finite automata are undecidable (i.e., recursively unsolvable). In contrast, we also prove three related problems are decidable. We apply one result to…

Several structural results about permutation groups of finite rank definable in differentially closed fields of characteristic zero (and other similar theories) are obtained. In particular, it is shown that every finite rank definably…

It is known that a group G definable in the field of p-adic numbers is definably locally isomorphic to the group of Q_p-points of a connected algebraic group H defined over Q_p. We show that if H is commutative then G is…

We present an axiomatic approach to finite- and infinite-dimensional differential calculus over arbitrary infinite fields (and, more generally, suitable rings). The corresponding basic theory of manifolds and Lie groups is developed.…

We solve a well known, long-standing open problem in relational databases theory, showing that the conjunctive query determinacy problem (in its "unrestricted" version) is undecidable.

In [1], we introduced the weakly synchronizing languages for probabilistic automata. In this report, we show that the emptiness problem of weakly synchronizing languages for probabilistic automata is undecidable. This implies that the…

The problem of determining whether a probabilistic program terminates almost surely (i.e.~with probability one) is undecidable, and actually $\Pi^0_2$-complete. For this reason, a growing literature has explored classes of programs for…

We consider expressions built up from binary relation names using the operators union, composition, and set difference. We show that it is undecidable to test whether a given such expression $e$ is finitely satisfiable, i.e., whether there…

First-order predicate logic extended with linear arithmetic is undecidable, in general. We show that the Bernays-Sch\"onfinkel-Ramsey (BSR) fragment extended with linear arithmetic restricted to simple bounds (SB) is decidable through…