Presburger arithmetic
First-order theory of the natural numbers with addition
Presburger arithmetic is the first-order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who introduced it in 1929. The signature of Presburger arithmetic contains only the addition operation and equality, omitting the multiplication operation entirely.
Nº Q956059 ★
Common · Knowledge
Presburger arithmetic
First-order theory of the natural numbers with addition
Presburger arithmetic is the first-order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who introduced it in 1929. The signature of Presburger arithmetic contains only the addition operation and equality, omitting the multiplication operation entirely.
From Wikipedia
Presburger arithmetic is the first-order theory of the natural numbers with addition, named in honor of Mojżesz Presburger, who introduced it in 1929. The signature of Presburger arithmetic contains only the addition operation and equality, omitting the multiplication operation entirely. The theory is computably axiomatizable; 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 algorithmically 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 algorithm is at least doubly exponential, however, as shown by Fischer & Rabin (1974).
Text: Wikipédia, CC BY-SA 4.0. ·
Related cards
-
S
Second-order arithmetic
Mathematical system
Nº Q7442973 ★
Not listed
-
R
Robinson arithmetic
Finitely axiomatized fragment of first-order Peano arithmetic that is recursively incompletable (in the sense of Gödel’s incompleteness theorems) and essentially undecidable
Nº Q928884 ★
Not listed
-
Dirichlet's theorem on arithmetic progressions
Theorem that, for coprime 𝑎 and 𝑑, there are infinitely many primes congruent to 𝑎 modulo 𝑑
Nº Q550402 ★★
Not listed
-
The Foundations of Arithmetic
Book by Gottlob Frege
Nº Q732146 ★
Not listed
-
Prime number
Positive integer with exactly two divisors, 1 and itself
Nº Q49008 ★★★★★
Not listed
-
Riemann sum
Approximation technique in integral calculus
Nº Q1156903 ★★★
Not listed