Now for a model-based explanation of the concept of Gödel numbering. The basic idea here is to regiment a scheme for associating a natural number with a first-order formula, and vice versa -- where this association must be completely mechanical. Sometimes this ingenious concept is presented in impenetrable ways, but with help from our simian machines, and simple diagrammatic aids (viz., tables), the concept becomes transparent.4
To begin, recall that a particular use of first-order logic is based on the
selection of constants, and function and relation symbols. The set Sar =
,
central to Gödel I, contains two (binary) function
symbols, two constants, and one (binary, or 2-place) relation symbol,
respectively. But what about the general case? If we leave aside constants, and
we write
fnm for a the mth n-ary function symbol, and Rmn for the
mth n-ary relation symbol, then all first-order formulas are built by
concatenating symbols from this (infinite) table.
Next, consider this corresponding (infinite) table, which has a structure isomorphic to the one just given.
Now, recall our monkey and simian machines; fix again the relevant mental
images. It's a trivial matter to have our monkey obtain the Gödel number of a
given formula (or to have him work in the opposite direction), using the the two
tables. An example should make this clear. Consider the formula