In the present paper, we discuss Husserl's deep account of the notions of ?calculation? and of arithmetical ?operation? which is found in the final chapter of the Philosophy of Arithmetic, arguing that Husserl is as far as we know the first scholar to reflect seriously on and to investigate the problem of circumscribing the totality of computable numerical operations. We pursue two complementary goals, namely: (i) to provide a formal reconstruction of Husserl's intuitions, and (ii) to demonstrate on the basis (...) of our reconstruction that the class of operations that Husserl has in mind turns out to be extensionally equivalent to the one that, in contemporary logic, is known as the class of partial recursive functions. (shrink)

In this article, we study some new characterizations of primitive recursive functions based on restricted forms of primitive recursion, improving the pioneering work of R. M. Robinson and M. D. Gladstone. We reduce certain recursion schemes (mixed/pure iteration without parameters) and we characterize one-argument primitive recursive functions as the closure under substitution and iteration of certain optimal sets.

Traces the development of recursive functions from their origins in the late nineteenth century to the mid-1930s, with particular emphasis on the work and influence of Kurt Gödel.

Programming practice suggests a notion of general iteration corresponding to the while-do construct. This leads to new characterizations of general computable unary functions usable in computer science.