Gödel's β function

In mathematical logic, Gödel's β function is a function used to permit quantification over finite sequences of natural numbers in formal theories of arithmetic. The β function is used, in particular, in showing that the class of arithmetically definable functions is closed under primitive recursion, and therefore includes all primitive recursive functions.

Definition

The β function takes three natural numbers as arguments. It is defined as

β(x₁, x₂, x₃) = rem(x₁, 1 + (x₃ + 1) · x₂) ( = rem(x₁, (x₃ · x₂ + x₂ + 1) )

where rem(x, y) denotes the remainder after integer division of x by y (Mendelson 1997:186).

Properties

The β function is arithmetically definable in an obvious way, because it uses only arithmetic operations and the remainder function which is arithmetically definable. It is therefore representable in Robinson arithmetic and stronger theories such as Peano arithmetic. By fixing the first two arguments appropriately, one can arrange that the values obtained by varying the final argument from 0 to n run through any specified n + 1-tuple of natural numbers (the β lemma described in detail below). This allows simulating the quantification over sequences of natural numbers of arbitrary length, which cannot be done directly in the language of arithmetic, by quantification over just two numbers, to be used as the first two arguments of the β function. Concretely, if f is a function defined by primitive recursion on a parameter n, say by f(0) = c and f(n+1) = g(n,f(n)), then to express f(n)= y one would like to say: there exists a sequence a₀, a₁, …, a_n such that a₀= c, a_n = y and for all i < n one has g(i,a_i)=a_i+1. While that is not possible directly, one can say instead: there exist natural numbers a, b such that β(a,b,0) = c, β(a,b,n)=y and for all i < n one has 'g(i,β(a,b,i)) = β(a,b,i+1).

The β lemma

The utility of the β function comes from the following result (Mendelson 1997:186), which is also due to Gödel.

The β Lemma. For any sequence of natural numbers (k₀, k₁, …, k_n), there are natural numbers b and c such that, for every i ≤ n, β(b, c, i) = k_i.

This follows from the Chinese remainder theorem.

See also

• Gödel numbering for sequences
• Gödel's incompleteness theorems
• Diagonal lemma

References

• Elliott Mendelson (1997). Introduction to Mathematical Logic (4th ed.). CRC Press. ISBN 0-412-80830-7. 
• Wolfgang Rautenberg (2010). A Concise Introduction to Mathematical Logic (3rd ed.). New York: Springer Science+Business Media. p. 244. doi:10.1007/978-1-4419-1221-3. ISBN 978-1-4419-1220-6. 

External links

• Stephen Simpson, Foundations of Mathematics lecture notes, section 2.2.