Definable groups in models of Presburger Arithmetic and G00
Abstract
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 definable in a model (Z,+,<) of Presburger Arithmetic is definably isomorphic to (Z, +)n mod out by a lattice.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.