Arrow Research search
Back to STOC

STOC 1973

Elementary Bounds for Presburger Arithmetic

Conference Paper Accepted Paper Algorithms and Complexity ยท Theoretical Computer Science

Abstract

We consider the first-order theory whose language has as nonlogical symbols the constant symbols 0 and 1, the binary relation symbols = and <, the unary function symbol โˆ’ and the binary function symbol +

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
1042378068800556278
v2026.09.13