On nested simple recursion

DOI10.1007/S00153-011-0236-9MaRDI QIDQ634775zbMATH OpenOpenAlexFDO

Authors Ján Komara

Publication date 16 August 2011

Published in Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00153-011-0236-9

zbMATH Keywords

nested simple recursionpairing functionprimitive recursive functions

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Review text

The author proposes a new proof of Peter's result that the class of primitive recursive functions is closed under nested simple recursion. The proof is based on the arithmetization of the computation trees for the functions defined by the nested simple recursion.

Recommendations

• scientific article; zbMATH DE number 1670762
• Nested arrays and recursion
• Nested recursions, simultaneous parameters and tree superpositions
• scientific article; zbMATH DE number 465472
• Nested recursions with ceiling function solutions
• Recursive functions
• scientific article; zbMATH DE number 3165537
• An Interesting Recursion
• scientific article; zbMATH DE number 409549

Cites work

• Herbrand analyses
• scientific article; zbMATH DE number 733384 (Why is no real title available?)
• scientific article; zbMATH DE number 3320380 (Why is no real title available?)
• Induction rules, reflection principles, and provably recursive functions
• Über den Zusammenhang der verschiedenen Begriffe der rekursiven Funktion

Cited in

(4)

• The realm of primitive recursion
• Nested recursions with ceiling function solutions
• scientific article; zbMATH DE number 3017947 (Why is no real title available?)
• Do we need recursion?

This page was built for publication: On nested simple recursion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q634775)