Related papers: Defining $\mathbb Z$ using unit groups

In this note, we provide some results concerning the structure of a set $A\subseteq \mathbb{Z}_n^{\times}$, which has non-empty subset sums equally distributed modulo $n$. Here, $\mathbb{Z}_n^{\times}$ denotes the set which contains all the…

Let $K$ be a number field, let $L$ be an algebraic (possibly infinite degree) extension of $K$, and let $O_K$ $\subset$ $O_L$ be their rings of integers. Suppose $A$ is an abelian variety defined over $K$ such that $A(K)$ is infinite and…

H.J. Zassenhaus conjectured that any unit of finite order and augmentation $1$ in the integral group ring $\mathbb{Z}G$ of a finite group $G$ is conjugate in the rational group algebra $\mathbb{Q}G$ to an element of $G$. We prove the…

In a constructive setting, no concrete formulation of ordinal numbers can simultaneously have all the properties one might be interested in; for example, being able to calculate limits of sequences is constructively incompatible with…

Let $G$ be a finite group. We show that the order of the subgroup generated by coprime $\gamma_k$-commutators (respectively $\delta_k$-commutators) is bounded in terms of the size of the set of coprime $\gamma_k$-commutators (respectively…

We present a concept of uniform encodability of theories and develop tools related to this concept. As an application we obtain general undecidability results which are uniform for large families of structures. In the way, we define…

We present a version of G\"odel's Second Incompleteness Theorem for recursively enumerable consistent extensions of a fixed axiomatizable theory, by incorporating some bi-theoretic version of the derivability conditions. We also argue that…

In this paper we consider a fragment of the first-order theory of the real numbers that includes systems of equations of continuous functions in bounded domains, and for which all functions are computable in the sense that it is possible to…

Higher-order unification has been shown to be undecidable. Miller discovered the pattern fragment and subsequently showed that higher-order pattern unification is decidable and has most general unifiers. We extend the algorithm to…

We develop an algebraic notion of recognizability for languages of words indexed by countable linear orderings. We prove that this notion is effectively equivalent to definability in monadic second-order (MSO) logic. We also provide three…

We show that it is decidable whether or not a relation on the reals definable in the structure $\langle \mathbb{R}, +,<, \mathbb{Z} \rangle$ can be defined in the structure $\langle \mathbb{R}, +,<, 1 \rangle$. This result is achieved by…

We show that the first-order logical theory of the binary overlap-free words (and, more generally, the ${\alpha}$-free words for rational ${\alpha}$, $2 < {\alpha} \leq 7/3$), is decidable. As a consequence, many results previously obtained…

For a coalgebra $C_k$ over field $k$, we define the "coalgebra extension problem" as the question: what multiplication laws can we define on $C_k$ to make it a bialgebra over $k$? This paper answers this existence-uniqueness question for…

The set of integer number lists with finite length, and the set of binary trees with integer labels are both countably infinite. Many inductively defined types also have countably many elements. In this paper, we formalize the syntax of…

We consider generalized $\Lambda$-structures on algebras and schemes over the ring of integers $\mathit{O}_K$ of a number field $K$. When $K=\mathbb{Q}$, these agree with the $\lambda$-ring structures of algebraic K-theory. We then study…

We establish several results on the word problem for just infinite groups. First, for finitely generated just infinite groups we show that the word problem is uniformly decidable for presentations with recursively enumerable sets of…

We study first-order logic over unordered structures whose elements carry a finite number of data values from an infinite domain which can be compared wrt. equality. As the satisfiability problem for this logic is undecidable in general, in…

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

Let $K$ be a number field, and let $G$ be a finitely generated subgroup of $K^\times$. Without relying on the Generalized Riemann Hypothesis we prove an asymptotic formula for the number of primes $\mathfrak p$ of $K$ such that the order of…

We prove that the theory of all modules over the ring of algebraic integers is decidable.