Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. Presburger arithmetic is the first-order theory of the natural numbers with addition, named in honor of Mojzesz Presburger, who introduced it in 1929. The signature of Presburger arithmetic contains only the addition operation and equality, omitting the multiplication operation entirely. The axioms include a schema of induction. Presburger arithmetic is much weaker than Peano arithmetic, which includes both addition and multiplication operations. Unlike Peano arithmetic, Presburger arithmetic is a decidable theory. This means it is possible to effectively determine, for any sentence in the language of Presburger arithmetic, whether that sentence is provable from the axioms of Presburger arithmetic. The asymptotic running-time computational complexity of this decision problem is doubly exponential, however, as shown by Fischer and Rabin (1974).

Данное издание не является оригинальным. Книга печатается по технологии принт-он-деманд после получения заказа.