Hostname: page-component-7b7567c8c-7pwfn Total loading time: 0 Render date: 2026-11-16T02:05:51.010Z Has data issue: false hasContentIssue false

Deciding whether a relation defined inPresburger logiccan be defined in weaker logics

Published online by Cambridge University Press:  18 January 2008

Christian Choffrut*
Affiliation:
LIAFA, Université de Paris 7, 2 place Jussieu, 75251 Paris Cedex 05; cc@liafa.jussieu.fr
Get access

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 inPresburger arithmetic, are they definable in theseweaker logics? These logics, intuitively,are obtained by considering modulo and threshold counting predicates for differences of two variables.

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable