|
We can define by recursion a function from formulas of arithmetic to numbers, and the corresponding Gödel numbering as the inverse.
The symbols of the language of arithmetic are , , ,
, 0, , , , , the variables for any integer , and and . and are only used to define the order of operations, and should be inferred where appropriate in the definition below.
We can define a function by recursion as follows:
Clearly is a Gödel numbering, with
.
|