Deciding whether the ordering is necessary in a Presburger formula - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete Mathematics and Theoretical Computer Science Year : 2010

Deciding whether the ordering is necessary in a Presburger formula

Abstract

We characterize the relations which are first-order definable in the model of the group of integers with the constant 1. This allows us to show that given a relation defined by a first-order formula in this model enriched with the usual ordering, it is recursively decidable whether or not it is first-order definable without the ordering.
Fichier principal
Vignette du fichier
1300-4872-1-PB.pdf (216.41 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00990437 , version 1 (13-05-2014)

Identifiers

Cite

Christian Choffrut, Achille Frigeri. Deciding whether the ordering is necessary in a Presburger formula. Discrete Mathematics and Theoretical Computer Science, 2010, Vol. 12 no. 1 (1), pp.20-37. ⟨10.46298/dmtcs.510⟩. ⟨hal-00990437⟩
57 View
792 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More