Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Deciding whether the ...
Article

Deciding whether the ordering is necessary in a Presburger formula

Christian Choffrut (1), Achille Frigeri (1) (2)
(1) Laboratoire d'informatique Algorithmique : Fondements et Applications
(2) Dipartimento di Matematica, "Francesco Brioschi"
Download article
Open on HAL
Imported on
March 26, 2015
Published on
January 1, 2010
Last modified on
March 31, 2025
Volume 12
vol. 12:1
Automata, Logic and Semantics
DOI
10.46298/dmtcs.510
License
https://about.hal.science/hal-authorisation-v1
Indicators
983
Views
780
Downloads

Deciding whether the ordering is necessary in a Presburger formula

Christian Choffrut (1), Achille Frigeri (1) (2)
(1) Laboratoire d'informatique Algorithmique : Fondements et Applications
(2) Dipartimento di Matematica, "Francesco Brioschi"
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
  • Presburger arithmetics
Cited by

Source: OpenCitations

  • Group Separation Strikes Back

    2023 38th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS)

    Authors : Thomas Place ORCID, Marc Zeitoun ORCID

    Journal reference : Volume , 2023, pp. 1-13

    DOI : 10.1109/lics56636.2023.10175683
  • Theories of real addition with and without a predicate for integers

    Logical Methods in Computer Science

    Authors : Alexis Bès, Christian Choffrut ORCID

    Journal reference : Volume Volume 17, Issue 2, 2021, pp.

    DOI : 10.23638/lmcs-17(2:18)2021
Preview
Loading PDF preview...