Unary Primitive Recursive Functions
Daniel E. Severin
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.
Create a lesson
Related papers
StabQ: Quantum Program Analysis via Weighted Stabilizer Representations
Shangzhou Xia, Junjie Luo, Jianjun Zhao
Least-Squares and Low-Rank Approximation for Linear Relations Using a Diagrammatic Language
Júlia de Araújo Mota, Iago Leal de Freitas, Lucas Rufino et al.
AutoSR: Automatic Symbolic Regression by Searching Research States
Kejia Zhang, Youran Sun, Xinyu Ren et al.
Stationarity is not enough: tightness of the quantum mechanical bootstrap and the copositive cone
Daniel Keren
Technical Report: A Formal Semantics for Java Symbolic Evaluation using Large-Block Encoding
Soha Hussein, Stephen McCamant, Kelton OBrien et al.
Complete Reduction for Derivatives in a Transcendental Liouvillian Extension
Shaoshi Chen, Hao Du, Yiman Gao et al.