Classifications of Recursive Functions by Means of Hierarchies
From MaRDI portal
Cites work
- Arithmetical Predicates and Function Quantifiers
- Extension of an effectively generated class of functions by enumeration
- Hierarchies of number-theoretic predicates
- scientific article; zbMATH DE number 3125697 (Why is no real title available?)
- scientific article; zbMATH DE number 3335022 (Why is no real title available?)
- scientific article; zbMATH DE number 3082569 (Why is no real title available?)
- Incompleteness along paths in progressions of theories
- Nested recursion
- On a Subrecursive Hierarchy and Primitive Recursive Degrees
- On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
- Recursive well-orderings
- Transfinite recursive progressions of axiomatic theories
Cited in
(11)- Complexity of algorithms and computations
- Augmented loop languages and classes of computable functions
- An operator embedding theorem for complexity classes of recursive functions
- The intrinsic difficulty of recursive functions
- Complexity hierarchies beyond elementary
- P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property
- Recursive Pseudo-Well-Orderings
- Non-uniqueness at ω2 in Kleene'sO
- Hierarchies of number-theoretic functions. I
- Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive -rule
- Automatic structures and the problem of natural well-orderings
This page was built for publication: Classifications of Recursive Functions by Means of Hierarchies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3291527)
