Gödelization


	In 1931 Kurt Gödel established a representation between a formal system and the set of natural numbers to prove his famous incompleteness theorem. An axiom or a proof is encoded by assigning to each symbol in the expression odd numbers as the powers of successive primes. The expression can be recovered by factoring the number.


	Contributed by: Enrique Zeleny
	Show Initialization Code

The coding scheme for typographic symbols is defined as follows:

The first six expressions correspond to the five Peano axioms for arithmetic (the third one has two parts). The other three are proofs that can be interpreted informally; the first is that the successor for 0 is 1; the second is that the successor of the successor of 0 is 2; the last is that

Peano's Axioms (Wolfram MathWorld)

Gödel Number (Wolfram MathWorld)

"Gödelization" from The Wolfram Demonstrations Project
http://demonstrations.wolfram.com/Goedelization/

Contributed by: Enrique Zeleny

Free Download: Mathematica Player--Runs all Demonstrations & more

Browse all topics

Source page:

Name (optional)

Occupation (optional)

Organization (optional)

I use Mathematica:

often

occasionally

never

Country (optional)
Remember me

Note: Please do not include anything you consider confidential or proprietary. We will keep your information private. We will not give it to any third party.
Privacy Policy »