Affiliation:
1. University of Oxford, UK
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.
Publisher
Association for Computing Machinery (ACM)
Reference67 articles.
1. A Polynomial Time Algorithm for Counting Integral Points in Polyhedra When the Dimension is Fixed
2. On the Descriptional Complexity of Operations on Semilinear Sets;Beier Simon;Automata and Formal Languages (AFL) (EPTCS),2017
3. The complexity of logical theories
4. Alexis Bès. 2002. A survey of arithmetical definability. In A tribute to Maurice Boffa. Société Mathématique de Belgique 1--54. Alexis Bès. 2002. A survey of arithmetical definability. In A tribute to Maurice Boffa. Société Mathématique de Belgique 1--54.
5. Michael Blondin. 2018. Personal communication. (2018). Michael Blondin. 2018. Personal communication. (2018).
Cited by
44 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献