Register a SA Forums Account here!
JOINING THE SA FORUMS WILL REMOVE THIS BIG AD, THE ANNOYING UNDERLINED ADS, AND STUPID INTERSTITIAL ADS!!!

You can: log in, read the tech support FAQ, or request your lost password. This dumb message (and those ads) will appear on every screen until you register! Get rid of this crap by registering your own SA Forums Account and joining roughly 150,000 Goons, for the one-time price of $9.95! We charge money because it costs us money per month for bills, and since we don't believe in showing ads to our users, we try to make the money back through forum registrations.
 
  • Post
  • Reply
Doom Mathematic
Sep 2, 2008

echinopsis posted:

be fascinated by numbers

Adbot
ADBOT LOVES YOU

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.

Doom Mathematic
Sep 2, 2008
https://twitter.com/SummerTimeAlice/status/1581900888364707840

  • 1
  • 2
  • 3
  • 4
  • 5
  • Post
  • Reply