Related papers: Rigid models of Presburger arithmetic
This paper is devoted to understand groups definable in Presburger arithmetic. We prove the following theorems: Theorem 1. Every group definable in a model of Presburger Arithmetic is abelian-by-finite. Theorem 2. Every bounded group…
We determine all groups definable in Presburger arithmetic, up to a finite index subgroup.
We take two approaches to classifying the complexity of Presburger models: Scott analysis and degree spectra. In particular, we investigate the possible Scott sentence complexities and possible degree spectra of models of Presburger…
Presburger arithmetic is the first-order theory of the natural numbers with addition (but no multiplication). We characterize sets that can be defined by a Presburger formula as exactly the sets whose characteristic functions can be…
Our main result is to show that every infinite, countable, residually finite group $G$ admits a Hausdorff group topology which is neither discrete nor precompact.
We consider expansions of Presburger arithmetic with families of monadic polynomial predicates. (Examples of such predicates are the set of perfect squares, or the set of integers of the form $2n^3-5n+3$, etc.) Although the full attendant…
We prove a cell decomposition theorem for Presburger sets and introduce a dimension theory for Z-groups with the Presburger structure. Using the cell decomposition theorem we obtain a full classification of Presburger sets up to definable…
We present new results on finite satisfiability of logics with counting and arithmetic. One result is a tight bound on the complexity of satisfiability of logics with so-called local Presburger quantifiers, which sum over neighbors of a…
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…
We construct discrete groups $G$ with infinite center that are nevertheless W*-superrigid, meaning that the group von Neumann algebra $L(G)$ fully remembers the group $G$. We obtain these rigidity results both up to isomorphisms and up to…
We prove the linear orders first-order definable in the standard model $(\ZZ;<,+)$ of Presburger arithmetic are exactly those that are $(\ZZ;<,+)$-definably embeddable into the lexicographic ordering on $\ZZ^n$ for some $n$.
In this paper we prove that free solvable groups have finite Krull dimension. In fact, this is true for much wider class of solvable groups, termed rigid groups. Along the way we study the algebraic structure of the limit solvable groups…
We give a new proof that there are arbitrarily large indecomposable abelian groups; moreover, the groups constructed are absolutely indecomposable, that is, they remain indecomposable in any generic extension. However, any absolutely rigid…
In this work we have considered the complexity of the different structures as topological group on Z. We collect some new results, as well as some known results on the group of the integers in order to present: -A family of $2^\cont$…
We begin by proving that any Presburger-definable image of one or more sets of powers has zero natural density. Then, by adapting the proof of a dichotomy result on o-minimal structures by Friedman and Miller, we produce a similar dichotomy…
Presburger Arithmetic is the true theory of natural numbers with addition. We study interpretations of Presburger Arithmetic in itself. The main result of this paper is that all self-interpretations are definably isomorphic to the trivial…
We show that the extension of Presburger arithmetic by a quadratic generalised polynomial of a specific form is undecidable.
In "Non arithmetic super rigid groups: counter examples to Platonov's conjecture" Bass and Lubotzky gave a counter example to Platonov's conjecture by presenting an example of a linear group with super-rigidity which is not an arithmetic…
We present an exposition of our ongoing project in a new area of applicable mathematics: practical computation with finitely generated linear groups over infinite fields. Methodology and algorithms available for practical computation in…
We prove that there exist finitely presented, residually finite groups that are profinitely rigid in the class of all finitely presented groups but not in the class of all finitely generated groups. These groups are of the form $\Gamma…