- Doom Mathematic
- Sep 2, 2008
-
|
|
#
¿
Jun 1, 2023 00:13
|
|
- Adbot
-
ADBOT LOVES YOU
|
|
#
¿
May 18, 2024 22:50
|
|
- Doom Mathematic
- Sep 2, 2008
-
|
Wrap it up, Gödelailures:
quote:
Mojżesz Presburger proved Presburger arithmetic to be:
- consistent: There is no statement in Presburger arithmetic which can be deduced from the axioms such that its negation can also be deduced.
- complete: For each statement in the language of Presburger arithmetic, either it is possible to deduce it from the axioms or it is possible to deduce its negation.
- decidable: There exists an algorithm which decides whether any given statement in Presburger arithmetic is a theorem or a nontheorem.
|
#
¿
Jun 3, 2023 00:11
|
|