Hierarchies in Recursive Function Theory

DOI10.2307/1994038zbMath0222.02050OpenAlexW4210715695MaRDI QIDQ5626638

H. B. Enderton

Publication date: 1964

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

Mathematics Subject Classification ID

Hierarchies of computability and definability (03D55)

Related Items (10)

Extracting long basic sequences from systems of dispersed vectors ⋮ Some properties of equivalence soft set relations ⋮ Universal grammars ⋮ A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy ⋮ On Minimal and Almost-Minimal Systems of Notations ⋮ Hierarchies in Recursive Function Theory ⋮ On a class of recursive hierarchies ⋮ Convex-transitivity and function spaces ⋮ Lindelöf type of generalization of separability in Banach spaces ⋮ On the antisymmetry of Galois embeddings

Cites Work

• Unnamed Item
• Unnamed Item
• On degrees of recursive unsolvability
• The upper semi-lattice of degrees of recursive unsolvability
• Arithmetical Predicates and Function Quantifiers
• Hierarchies of number-theoretic predicates
• Recursive well-orderings
• Ordinal Numbers and Predicative Set Theory
• Recursive Functions Over Well Ordered Partial Orderings
• Constructive Versions of Ordinal Number Classes
• Hierarchies in Recursive Function Theory
• On notation for ordinal numbers

This page was built for publication: Hierarchies in Recursive Function Theory