Definitional schemes for primitive recursive and computable functions
From MaRDI portal
Publication:5037214
DOI10.3233/COM-210312OpenAlexW3196464229MaRDI QIDQ5037214
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
Cites Work
- An easy priority-free proof of a theorem of Friedberg
- Primitive Recursive Functions. II
- A Note on Primitive Recursive Functions
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
- On the Algebraic Structure of Primitive Recursive Functions
- Another simplification of the recursion scheme
- Unary primitive recursive functions
- A reduction of the recursion scheme
- Simplifications of the recursion scheme
- Primitive recursive functions
- General Recursive Functions