Abstract
This paper resolves 3 problems left open by R. M. Robinson in [3].We recall that the set of primitive recursive functions is the closure under (i) substitution (or “composition”), and (ii) recursion, of the set P consisting of the zero, successor and projection functions (see any textbook, for instance p. 120 of [2]).
Publisher
Cambridge University Press (CUP)
Reference3 articles.
1. Primitive recursive functions
2. A reduction of the recursion scheme;Gladstone;this Journal,1967
Cited by
24 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Exploring the philosophical perspectives of future robots;International Journal of Parallel, Emergent and Distributed Systems;2024-08-29
2. Definitional schemes for primitive recursive and computable functions;Computability;2022-01-12
3. Iteration on notation and unary functions;Mathematical Logic Quarterly;2013-11
4. Partial Recursive Functions and Finality;Computation, Logic, Games, and Quantum Foundations. The Many Facets of Samson Abramsky;2013
5. Monotonicity Constraints in Characterizations of PSPACE;Journal of Logic and Computation;2010-02-17