A survival guide to Presburger arithmetic
The work
| Authors | Christoph Haase |
|---|---|
| Editors | |
| Type | article |
| Year | 2018 |
| Citekey | haase2018survival |
Where it appeared
| Published in | ACM SIGLOG News |
|---|---|
| Publisher | Association for Computing Machinery |
| Volume | 5 |
| Issue | 3 |
| Pages | 67--82 |
Identifiers
| DOI | 10.1145/3242953.3242964 |
|---|
Abstract
The first-order theory of the integers with addition and order, commonly known as Presburger arithmetic, has been a central topic in mathematical logic and computer science for almost 90 years. Presburger arithmetic has been the starting point for numerous lines of research in automata theory, model theory and discrete geometry. In formal verification, Presburger arithmetic is the first-choice logic to represent and reason about systems with infinitely many states. This article provides a broad yet concise overview over the history, decision procedures, extensions and geometric properties of Presburger arithmetic.
A copy is held
pdf, 2.1 MB. Not published — it may be under copyright. The facts and links here are.
How it got here
| How it got here | import via bibtex |
|---|---|
| Added | 2026-08-05 00:00 UTC |
| Approved by | a person 2026-08-18 09:48 UTC |
Filed under
Cite it as
@article{haase2018survival,
title = {A survival guide to Presburger arithmetic},
author = {Christoph Haase},
year = {2018},
journal = {ACM SIGLOG News},
publisher = {Association for Computing Machinery},
volume = {5},
number = {3},
pages = {67--82},
doi = {10.1145/3242953.3242964},
}
This record lives at https://refs.drheap.org/haase2018survival/ and will keep doing so.