On a Subrecursive Hierarchy and Primitive Recursive Degrees

DOI10.2307/1993169zbMath0087.01102OpenAlexW4241156757WikidataQ56037873 ScholiaQ56037873MaRDI QIDQ3257773

P. Axt

Publication date: 1959

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

zbMATH Keywords

philosophy and foundations of mathematics

Related Items (10)

Relativization of a primitive recursive hierarchy ⋮ Unnamed Item ⋮ Degrees of relative provability ⋮ Augmented loop languages and classes of computable functions ⋮ Polynomial and abstract subrecursive classes ⋮ On the density of honest subrecursive classes ⋮ On the structure of subrecursive degrees ⋮ Classifications of Recursive Functions by Means of Hierarchies ⋮ Relativization of the Theory of Computational Complexity ⋮ P.R.-Regulated Systems of Notation and the Subrecursive Hierarchy Equivalence Property

Cites Work

• The upper semi-lattice of degrees of recursive unsolvability
• Arithmetical Predicates and Function Quantifiers
• On the Forms of the Predicates in the Theory of Constructive Ordinals (Second Paper)
• Extension of an effectively generated class of functions by enumeration
• Unnamed Item
• Unnamed Item

This page was built for publication: On a Subrecursive Hierarchy and Primitive Recursive Degrees