Definitional schemes for primitive recursive and computable functions

DOI10.3233/COM-210312MaRDI QIDQ5037214zbMATH OpenOpenAlexFDO

Authors Pace P. Nielsen

Publication date 28 February 2022

Published in Computability (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/com-210312

zbMATH Keywords

partial computable functionunary primitive recursive function

Mathematics Subject Classification ID

Recursive functions and relations, subrecursive hierarchies (03D20)

Recommendations

• Unary primitive recursive functions
• scientific article; zbMATH DE number 3557782
• Succinct iterative characterizations of primitive computable unary functions
• Primitive iteration and unary functions
• Impossibility of finite generation of partial recursive functions by a unary isotone operation

Cites work

• A Note on Primitive Recursive Functions
• A reduction of the recursion scheme
• An easy priority-free proof of a theorem of Friedberg
• Another simplification of the recursion scheme
• General Recursive Functions
• On the Algebraic Structure of Primitive Recursive Functions
• Primitive Recursive Functions. II
• Primitive recursive functions
• Simplifications of the recursion scheme
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• Unary primitive recursive functions

Cited in

(3)

• Sketches and computation – I: basic definitions and static evaluation
• scientific article; zbMATH DE number 3310899 (Why is no real title available?)
• scientific article; zbMATH DE number 6863850 (Why is no real title available?)

This page was built for publication: Definitional schemes for primitive recursive and computable functions

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