A degree-theoretic definition of the ramified analytical hierarchy
- 31 August 1976
- journal article
- Published by Elsevier BV in Annals of Mathematical Logic
- Vol. 10 (1), 1-32
- https://doi.org/10.1016/0003-4843(76)90023-1
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Degrees in Which the Recursive Sets are Uniformly RecursiveCanadian Journal of Mathematics, 1972
- The fine structure of the constructible hierarchyAnnals of Mathematical Logic, 1972
- A note on the hyperarithmetical hierarchyThe Journal of Symbolic Logic, 1970
- Bar Induction and Π11-CAThe Journal of Symbolic Logic, 1969
- Uniformly introreducible setsThe Journal of Symbolic Logic, 1969
- A recursion-theoretic characterization of the ramified analytical hierarchyTransactions of the American Mathematical Society, 1969
- Degrees of unsolvability of constructible sets of integersThe Journal of Symbolic Logic, 1969
- Recursive pseudo-well-orderingsTransactions of the American Mathematical Society, 1968
- A criterion for completeness of degrees of unsolvabilityThe Journal of Symbolic Logic, 1957
- The Upper Semi-Lattice of Degrees of Recursive UnsolvabilityAnnals of Mathematics, 1954