A degree-theoretic definition of the ramified analytical hierarchy

DOI10.1016/0003-4843(76)90023-1zbMath0333.02039OpenAlexW2026230232MaRDI QIDQ4100082

Stephen G. Simpson, Carl G. jun. Jockusch

Publication date: 1976

Published in: Annals of Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0003-4843(76)90023-1

Mathematics Subject Classification ID

Other degrees and reducibilities in computability and recursion theory (03D30) Hierarchies of computability and definability (03D55)

Related Items

Upper bounds for the arithmetical degrees, Finite level Borel games and a problem concerning the jump hierarchy, Degrees of Unsolvability: A Tutorial, The jump is definable in the structure of the degrees of unsolvability, STRUCTURAL HIGHNESS NOTIONS, Uncountable master codes and the jump hierarchy, DIRECT AND LOCAL DEFINITIONS OF THE TURING JUMP, Inner model operators in \(L(\mathbb{R})\), Local Definitions in Degree Structures: The Turing Jump, Hyperdegrees and Beyond, A classification of jump operators, Uniform upper bounds on ideals of turing degrees, Possible-worlds semantics for modal notions conceived as predicates, Mass problems associated with effectively closed sets, More about uniform upper bounds on ideals of turing degrees, On homogeneity and definability in the first-order theory of the Turing degrees, Effective randomness for continuous measures, On the role of Ramsey quantifiers in first order arithmetic, Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers