| 1. | Let denote the unary primitive recursive function given by this definition.
|
| 2. | Primitive recursive functions are a defined subclass of the recursive functions.
|
| 3. | Primitive recursive functions are a defined subclass of the recursive functions.
|
| 4. | Tetration is neither an elementary function nor an elementary recursive function.
|
| 5. | The second recursion theorem can be applied to any total recursive function.
|
| 6. | Stacks are an important way of supporting nested or recursive function calls.
|
| 7. | With regards to ( 3 ), Kleene considers primitive recursive functions:
|
| 8. | This recursive function terminates if either conditions 1 or 2 are satisfied.
|
| 9. | The diagonal lemma applies to theories capable of representing all primitive recursive functions.
|
| 10. | A subset of these is the primitive recursive functions.
|
