Hierarchies in Recursive Function Theory
From MaRDI portal
Publication:5626638
DOI10.2307/1994038zbMath0222.02050MaRDI QIDQ5626638
Publication date: 1964
Full work available at URL: https://doi.org/10.2307/1994038
03D55: Hierarchies of computability and definability
Related Items
A Recursion-Theoretic Characterization of the Ramified Analytical Hierarchy, On Minimal and Almost-Minimal Systems of Notations, Hierarchies in Recursive Function Theory, Extracting long basic sequences from systems of dispersed vectors, Some properties of equivalence soft set relations, Lindelöf type of generalization of separability in Banach spaces, Universal grammars, On a class of recursive hierarchies, On the antisymmetry of Galois embeddings, Convex-transitivity and function spaces
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