2018/06/01 by Nathanaël Mariaule, Mariaule, Nathanaël
Computer Science · Mathematics · #03C64 #Advanced Topology and Set Theory #Computability, Logic, AI Algorithms #FOS: Mathematics #Logic (math.LO) #Mathematical and Theoretical Analysis #math.LO #msc:03C64
paper · pdf · doi:10.48550/arxiv.1806.00315
10 pages
arxiv created 2018/06/01 · openalex publication_date 2018/06/01 · arxiv updated 2018/06/04 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Let G be a model of Presburger arithmetic. Let L be an expansion of the language of Presburger LPres. In this paper we prove that the L-theory of G is LPres-minimal iff it has the exchange property and any bounded definable set has a maximum.