Pages that link to "Item:Q3256313"
From MaRDI portal
The following pages link to Extension of an effectively generated class of functions by enumeration (Q3256313):
Displayed 19 items.
- Degrees of relative provability (Q691125) (← links)
- Completeness of the primitive recursive \(\omega \)-rule (Q781515) (← links)
- On a complexity-based way of constructivizing the recursive functions (Q922528) (← links)
- Indexings of subrecursive classes (Q1140080) (← links)
- Complexity of algorithms and computations (Q1153141) (← links)
- Fast growing functions based on Ramsey theorems (Q1191932) (← links)
- Augmented loop languages and classes of computable functions (Q1219687) (← links)
- Polynomial and abstract subrecursive classes (Q1227276) (← links)
- On bimodal logics of provability (Q1332858) (← links)
- Iteration of relative primitive recursion (Q2538125) (← links)
- On the structure of subrecursive degrees (Q2546043) (← links)
- Relativization of a primitive recursive hierarchy (Q2626203) (← links)
- On a Subrecursive Hierarchy and Primitive Recursive Degrees (Q3257773) (← links)
- Classifications of Recursive Functions by Means of Hierarchies (Q3291527) (← links)
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property (Q4140975) (← links)
- THE NONARITHMETICITY OF THE PREDICATE LOGIC OF STRICTLY PRIMITIVE RECURSIVE REALIZABILITY (Q5099782) (← links)
- Constructive Recursive Functions, Church’s Thesis, and Brouwer’s Theory of the Creating Subject: Afterthoughts on a Parisian Joint Session (Q5250212) (← links)
- Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule (Q5937826) (← links)
- The hierarchy of terminating recursive programs over N (Q6064287) (← links)