Does anyone know a natural decidable problem that is equivalent to Presburger Arithmetic? (Presburger Arithmetic has a complexity lower bound of nondeterministic double exponential time and an upper bound of double exponential space). — JS Sent from my iPhone