Classifications of Recursive Functions by Means of Hierarchies

DOI10.2307/1993935zbMath0106.00602OpenAlexW4229864199MaRDI QIDQ3291527

Solomon Feferman

Publication date: 1962

Full work available at URL: https://doi.org/10.2307/1993935

zbMATH Keywords

logics, foundations, philosophy

Related Items

Non-uniqueness at ω2 in Kleene'sO, Hierarchies of number-theoretic functions. I, The intrinsic difficulty of recursive functions, Recursive Pseudo-Well-Orderings, Complexity of algorithms and computations, Strictly primitive recursive realizability. II: Completeness with respect to iterated reflection and a primitive recursive \(\omega\)-rule, Augmented loop languages and classes of computable functions, An operator embedding theorem for complexity classes of recursive functions, Complexity Hierarchies beyond Elementary, P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nested recursion
• Arithmetical Predicates and Function Quantifiers
• Hierarchies of number-theoretic predicates
• Recursive well-orderings
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• Extension of an effectively generated class of functions by enumeration
• On a Subrecursive Hierarchy and Primitive Recursive Degrees
• Transfinite recursive progressions of axiomatic theories
• Incompleteness along paths in progressions of theories