@Article{ Choffrut2008,
Author = "Choffrut, Christian",
Abstract = "We consider logics on $\mathbb\{Z\}$ and $\mathbb\{N\}$ which are weaker than Presburger arithmetic and we settle the following decision problem: given a k-ary relation on $\mathbb\{Z\}$ and $\mathbb\{N\}$ which are first order definable in Presburger arithmetic, are they definable in these weaker logics? These logics, intuitively, are obtained by considering modulo and threshold counting predicates for differences of two variables.",
date-added = "2020-03-03 16:09:59 +0100",
date-modified = "2020-03-03 16:09:59 +0100",
Journal = "RAIRO - Theoretical Informatics and Applications",
Keywords = "Presburger arithmetic; first order logic; decidability; first-order logic",
Language = "eng",
Month = "1",
Number = "1",
Pages = "121-135",
Publisher = "EDP Sciences",
Title = "Deciding whether a relation defined in Presburger logic can be defined in weaker logics",
URL = "http://eudml.org/doc/250349",
Volume = "42",
Year = "2008",
bdsk-url-1 = "http://eudml.org/doc/250349",
File = "Deciding whether a relation defined in Presburger logic can be defined in weaker logics - a - a - t.pdf"
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A