Definable groups in models of Presburger Arithmetic

&
Annals of Pure and Applied Logic 171 (6):102795 (2020)
  Copy   BIBTEX

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 abelian group definable in a model of (Z, +, <) Presburger Arithmetic is definably isomorphic to (Z, +)^n mod out by a lattice.

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2020.102795

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,953

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

Presburger sets and p-minimal fields.Raf Cluckers - 2003 - Journal of Symbolic Logic 68 (1):153-162.
Presburger arithmetic and recognizability of sets of natural numbers by automata: New proofs of Cobham's and Semenov's theorems.Christian Michaux & Roger Villemaire - 1996 - Annals of Pure and Applied Logic 77 (3):251-277.
Bounding quantification in parametric expansions of Presburger arithmetic.John Goodrick - 2018 - Archive for Mathematical Logic 57 (5-6):577-591.
Model-checking CTL* over flat Presburger counter systems.Stéphane Demri, Alain Finkel, Valentin Goranko & Govert van Drimmelen - 2010 - Journal of Applied Non-Classical Logics 20 (4):313-344.
A note on definability in fragments of arithmetic with free unary predicates.Stanislav O. Speranski - 2013 - Archive for Mathematical Logic 52 (5-6):507-516.
Remarks on formalized arithmetic and subsystems thereof.C. Brink - unknown
Presburger arithmetic with unary predicates is Π11 complete.Joseph Y. Halpern - 1991 - Journal of Symbolic Logic 56 (2):637 - 642.
Nonstandard models that are definable in models of Peano Arithmetic.Kazuma Ikeda & Akito Tsuboi - 2007 - Mathematical Logic Quarterly 53 (1):27-37.
Definable sets and expansions of models of Peano arithmetic.Roman Murawski - 1988 - Archive for Mathematical Logic 27 (1):21-33.
Theories of arithmetics in finite models.Michał Krynicki & Konrad Zdanowski - 2005 - Journal of Symbolic Logic 70 (1):1-28.
On the completeness of a certain system of arithmetic of whole numbers in which addition occurs as the only operation.Mojżesz Presburger & Dale Jabcquette - 1991 - History and Philosophy of Logic 12 (2):225-233.
Rigid models of Presburger arithmetic.Emil Jeřábek - 2019 - Mathematical Logic Quarterly 65 (1):108-115.
Ω1-like recursively saturated models of Presburger's arithmetic.Victor Harnik - 1986 - Journal of Symbolic Logic 51 (2):421-429.
Presburger arithmetic, rational generating functions, and quasi-polynomials.Kevin Woods - 2015 - Journal of Symbolic Logic 80 (2):433-449.
Reasoning About Reversal-Bounded Counter Machines.Stéphane Demri - 2018 - In Michał Zawidzki & Joanna Golińska-Pilarek (eds.), Ewa Orłowska on Relational Methods in Logic and Computer Science. Cham, Switzerland: Springer Verlag.

Analytics

Added to PP
2020-03-20

Downloads
19 (#823,744)

6 months
6 (#588,245)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

Characterizing Rosy Theories.Clifton Ealy & Alf Onshuus - 2007 - Journal of Symbolic Logic 72 (3):919 - 940.
Quasi-o-minimal structures.Oleg Belegradek, Ya'acov Peterzil & Frank Wagner - 2000 - Journal of Symbolic Logic 65 (3):1115-1132.
Forking in VC-minimal theories.Sarah Cotter & Sergei Starchenko - 2012 - Journal of Symbolic Logic 77 (4):1257-1271.
Forking and independence in o-minimal theories.Alfred Dolich - 2004 - Journal of Symbolic Logic 69 (1):215-240.

View all 8 references / Add more references