Proof: All recursive functions are arithmetic (logic)

107 Views Asked by At

So I'm trying to understand the proof of the following statement:

> All recursive functions are arithmetic

The proof begins with:

"It is sufficient to show that all arithmetic functions satisfy the properties in the definition of a recursive function"

Why is this true? From my perspective this only proves that all arithmetic functions are recursive.