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

Let $G$ be a definable group in a $p$-adically closed field $M$. We show that $G$ has finitely satisfiable generics (fsg) if and only if $G$ is definably compact. The case $M = \mathbb{Q}_p$ was previously proved by Onshuus and Pillay.

Let K be a field and \tilde{K} denote the set of all r \in K for which there exists a finite set A(r) with {r} \subseteq A(r) \subseteq K such that each mapping f:A(r) \to K that satisfies: if 1 \in A(r) then f(1)=1, if a,b \in A(r) and a+b…

The fixed template Promise Constraint Satisfaction Problem (PCSP) is a recently proposed significant generalization of the fixed template CSP, which includes approximation variants of satisfiability and graph coloring problems. All the…

We study the strength of set-theoretic axioms needed to prove Rabin's theorem on the decidability of the MSO theory of the infinite binary tree. We first show that the complementation theorem for tree automata, which forms the technical…

Fix a non-negative integer g and a positive integer I dividing 2g-2. For any Henselian, discretely valued field K whose residue field is perfect and admits a degree I cyclic extension, we construct a curve C over K of genus g and index I.…

We study on finite unramified extensions of global function fields (function fields of one valuable over a finite field). We show two results. One is an extension of Perret's result about the ideal class group problem. Another is a…

We establish unconditionally that for every integer $k \geq 1$ there is a language $L \in \mbox{P}$ such that it is consistent with Cook's theory PV that $L \notin Size(n^k)$. Our argument is non-constructive and does not provide an…

In quantum field theory radiative corrections can be finite but undetermined.

In this short note we confirm the relation between the generalized $abc$-conjecture and the $p$-rationality of number fields. Namely, we prove that given K$/\mathbb{Q}$ a real quadratic extension or an imaginary $S_3$-extension, if the…

Let $K$ be a $p$-adically closed field and $G$ a group interpretable in $K$. We show that if $G$ is definably semisimple (i.e. $G$ has no definable infinite normal abelian subgroups) then there exists a finite normal subgroup $H$ such that…

Let S be a polynomial ring over a field of characteristic zero in finitely may variables. Let T be an unramified, finitely generated extension of S with $T^\times = k^\times$. Then T = S.

Rice's Theorem states that every nontrivial language property of the recursively enumerable sets is undecidable. Borchert and Stephan initiated the search for complexity-theoretic analogs of Rice's Theorem. In particular, they proved that…

We prove some general estimates for exponential sums over subsets of finite fields which are definable in the language of rings. This generalizes both the classical exponential sum estimates over varieties over finite fields due to Weil,…

We establish the decidability of the $\Sigma_2$ theory of both the arithmetic and hyperarithmetic degrees in the language of uppersemilattices i.e. the language with $\leq, 0$ and $\sqcup$. This is achieved by using Kumabe-Slaman forcing -…

We study a reduct L\ast of the ring language where multiplication is restricted to a neighbourhood of zero. The language is chosen such that for p-adically closed fields K, the L\ast-definable subsets of K coincide with the semi-algebraic…

We give a positive answer to a question of J. Doyle and J. Silverman about fields of definition of dynamical systems on $\mathbb{P}^{n}$. We prove that, for fixed $n$, there exists a constant $C_{n}$ such that every dynamical system…

We prove an impossibility result for conditional Probably Approximately Correct (PAC)-efficient reasoning in large language models. While recent work has established marginal PAC efficiency guarantees for composite models that switch…

The ordered structures of natural, integer, rational and real numbers are studied here. It is known that the theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language…

Fix a language L extending the language of real closed fields by at least one new predicate or function symbol. Call an L-structure R pseudo-o-minimal if it is (elementarily equivalent to) an ultraproduct of o-minimal structures. We show…

Irreducible symplectic varieties are higher-dimensional analogues of K3 surfaces. In this paper, we prove the finiteness of twists of irreducible symplectic varieties via a fixed finite field extension of characteristic $0$. The main…