Extension of an effectively generated class of functions by enumeration
From MaRDI portal
Cited in
(19)- Indexings of subrecursive classes
- Complexity of algorithms and computations
- Fast growing functions based on Ramsey theorems
- Augmented loop languages and classes of computable functions
- Polynomial and abstract subrecursive classes
- On bimodal logics of provability
- Iteration of relative primitive recursion
- On the structure of subrecursive degrees
- Relativization of a primitive recursive hierarchy
- On a Subrecursive Hierarchy and Primitive Recursive Degrees
- Classifications of Recursive Functions by Means of Hierarchies
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property
- THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY
- Constructive recursive functions, Church's thesis, and Brouwer's theory of the creating subject: afterthoughts on a Parisian joint session
- Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive -rule
- The hierarchy of terminating recursive programs over N
- Degrees of relative provability
- Completeness of the primitive recursive \(\omega \)-rule
- On a complexity-based way of constructivizing the recursive functions
This page was built for publication: Extension of an effectively generated class of functions by enumeration
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3256313)
