General iteration and unary functions
From MaRDI portal
Publication:1182467
DOI10.1016/0168-0072(91)90029-LzbMATH Open0747.03018MaRDI QIDQ1182467FDOQ1182467
Publication date: 28 June 1992
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Recommendations
Cites Work
- Undecidable theories
- Title not available (Why is that?)
- On folk theorems
- Primitive iteration and unary functions
- Computable stack functions for semantics of stack programs
- Sequence recursiveness without cylindrification and limited register machines
- General iteration and unary functions
- Sequence-to-sequence recursiveness
- Title not available (Why is that?)
- Title not available (Why is that?)
- ITERATION AND RECURSION
- Primitive recursive functions
- General recursive functions of natural numbers
- General Recursive Functions
- Proving a compiler correct: A simple approach
- Title not available (Why is that?)
- Primitive Recursive Functions. II
- A Note on Primitive Recursive Functions
- Title not available (Why is that?)
- A flow diagram composition of Markov's normal algorithms without concluding formulas
- Simplifications of the recursion scheme
- A note on recursive functions
- Closure functions and general iterates as reflectors
- Recursive Functions of One Variable
- Recursion and double recursion
- Title not available (Why is that?)
Cited In (9)
- Primitive iteration and unary functions
- General iteration and unary functions
- Ein Kriterium für die Primitive Rekursivität der Funktional‐Iteration
- Unary functions
- Iteration on notation and unary functions
- Iterative Characterizations of Computable Unary Functions: A General Method
- Closure functions and general iterates as reflectors
- Iterated images on manifolds
- Succinct iterative characterizations of primitive computable unary functions
This page was built for publication: General iteration and unary functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1182467)
