Unary Primitive Recursive Functions
Symbolic Computation
2014-05-28 v3 Logic in Computer Science
Abstract
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 in this area. 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.
Cite
@article{arxiv.cs/0603063,
title = {Unary Primitive Recursive Functions},
author = {Daniel E. Severin},
journal= {arXiv preprint arXiv:cs/0603063},
year = {2014}
}