Primitive iteration and unary functions

DOI10.1016/0168-0072(88)90032-2zbMath0664.68047MaRDI QIDQ1115608

Stefano Mazzanti, Giorgio Germano

Publication date: 1988

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(88)90032-2

zbMATH Keywords

computable functions. primitive recursive sequence functions; primitive recursive unary functions

Mathematics Subject Classification ID

03D20: Recursive functions and relations, subrecursive hierarchies

03D60: Computability and recursion theory on ordinals, admissible sets, etc.

Related Items

Iteration on notation and unary functions, Unary primitive recursive functions, Succinct iterative characterizations of primitive computable unary functions, Closure functions and general iterates as reflectors, General iteration and unary functions

Cites Work

• Sequence recursiveness without cylindrification and limited register machines
• Sequence-to-sequence recursiveness
• Equivalence of partial recursivity and computability by algorithms without concluding formulas
• Primitive Recursive Functions. II
• A Note on Primitive Recursive Functions
• A classification of the one-argument primitive recursive functions
• A classification of an iterative hierarchy
• On the Algebraic Structure of Primitive Recursive Functions
• Comparing Hierarchies of Primitive Recursive Sequence Functions
• Classes of One‐Argument Recursive Functions
• Another simplification of the recursion scheme
• A reduction of the recursion scheme
• Recursive Functions of One Variable
• ITERATION AND RECURSION
• Simplifications of the recursion scheme
• Computability of Recursive Functions
• Primitive recursive functions
• General Recursive Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item