Related papers: Quantifier elimination in ordered abelian groups
Separability for groups refers to the question which subsets of a group can be detected in its finite quotients. Classically, separability is studied in terms of which classes have a certain separability property, and this question is…
We offer a $\forall\exists$-definition for (affine) Campana points over $\mathbb{P}^1_K$ (where $K$ is a number field), which constitute a set-theoretical filtration between $K$ and $\mathcal{O}_{K,S}$ ($S$-integers), which are well-known…
We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying…
We consider the problem of classifying gradings by groups on a finite-dimensional algebra $A$ (with any number of multilinear operations) over an algebraically closed field. We introduce a class of gradings, which we call almost fine, such…
It is well-known that abelian varieties are projective, and so that there exist explicit polynomial and rational functions which define both the variety and its group law. It is however difficult to find any explicit polynomial and rational…
Definable topological groups whose topologies are affine have definable $\mathcal C^r$ structures in d-minimal expansions of ordered fields, where $r$ is a positive integer. We prove this fact using a new notion called partition degree of a…
Let X be compact abelian group and G its dual (a discrete group). If B is an infinite subset of G, let C_B be the set of all x in X such that <phi(x) : phi \in B> converges to 1. If F is a free filter on G, let D_F be the union of all the…
Previous formulations of group theory in ACL2 and Nqthm, based on either "encapsulate" or "defn-sk", have been limited by their failure to provide a path to proof by induction on the order of a group, which is required for most interesting…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
Recent improvement on Tarski's procedure for quantifier elimination in the first order theory of real numbers makes it feasible to solve small instances of the following problems completely automatically: 1. listing all equality and…
Let $F$ be a free non-abelian group. We show that for any group word $w$ the set $w[F]$ of all values of $w$ in $F$ is rational in $F$ if and only if $w[F] = 1$ or $w[F] = F.$ We generalize this to a wide class of free products of groups.
In this paper we study elimination of imaginaries in some classes of pure ordered abelian groups. For the class of ordered abelian groups with bounded regular rank (equivalently with finite spines) we obtain weak elimination of imaginaries…
In this article we define a new reducibility based on the enumeration orders of r.e. sets.
We study finite-dimensional groups definable in models of the theory of real closed fields with a generic derivation (also known as CODF). We prove that any such group definably embeds in a semialgebraic group. We extend the results to…
We adapt the theory of partition rank and analytic rank to the category of abelian groups. If $A_1, \dots, A_k$ are finite abelian groups and $\phi : A_1 \times \cdots \times A_k \to \mathbf{T}$ is a multilinear map, where $\mathbf{T} =…
We prove that in every finitely generated profinite group, every subgroup of finite index is open; this implies that the topology on such groups is determined by the algebraic structure. This is deduced from the main result about finite…
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…
The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order…
We define a class of pre-ordered abelian groups that we call finite-by-Presburger groups, and prove that their theory is model-complete. We show that certain quotients of the multiplicative group of a local field of characteristic zero are…
The paper studies a cluster of systems for fully disquotational truth based on the restriction of initial sequents. Unlike well-known alternative approaches, such systems display both a simple and intuitive model theory and remarkable…